Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 4, 2026 00:40Josu San MartinJosu San MartinScore: 6,139Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:406,04059,513,38646,864,0003,271,0002,113,536
2Jul 4, 2026 00:406,04459,469,96146,922,0003,246,0002,113,536
3Jul 4, 2026 00:406,05659,581,25847,209,0003,058,0002,113,536
4Jul 4, 2026 00:406,10261,275,22747,534,0003,113,0002,113,536
5Jul 4, 2026 00:406,13960,320,45647,620,0003,341,0002,113,536
6Jul 4, 2026 00:406,19360,834,03448,218,0003,184,0002,113,536
7Jul 4, 2026 00:406,19960,798,89148,194,0003,265,0002,113,536
8Jul 4, 2026 00:406,22261,027,36848,412,0003,238,0002,113,536
9Jul 4, 2026 00:406,33462,008,12249,308,0003,270,0002,113,536