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 17, 2026 19:14Kevin HeaveyKevin HeaveyScore: 3,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 19:273,68248,555,47429,515,0001,048,0002,117,632
2Jul 17, 2026 19:273,77141,129,49130,260,0001,043,0002,113,536
3Jul 17, 2026 19:273,78050,496,50130,142,0001,238,0002,113,536
4Jul 17, 2026 19:273,94942,827,66331,732,0001,047,0002,113,536
5Jul 17, 2026 19:273,96243,313,14931,846,0001,045,0002,113,536
6Jul 17, 2026 19:273,96442,759,62531,861,0001,044,0002,113,536
7Jul 17, 2026 19:273,99643,003,86632,118,0001,049,0002,113,536
8Jul 17, 2026 19:274,00143,083,87732,021,0001,191,0002,113,536
9Jul 17, 2026 19:274,46853,741,02436,051,0001,040,0002,113,536