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 20, 2026 18:32Kevin HeaveyKevin HeaveyScore: 4,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 18:324,49446,877,44136,180,0001,121,0002,113,536
2Jul 20, 2026 18:324,49446,882,06736,163,0001,142,0002,113,536
3Jul 20, 2026 18:324,50246,935,68236,232,0001,141,0002,113,536
4Jul 20, 2026 18:324,52147,106,38536,402,0001,130,0002,113,536
5Jul 20, 2026 18:324,54547,299,94336,583,0001,143,0002,113,536
6Jul 20, 2026 18:324,55047,349,07236,620,0001,151,0002,113,536
7Jul 20, 2026 18:324,55147,452,00436,636,0001,140,0002,113,536
8Jul 20, 2026 18:324,75648,997,79138,339,0001,139,0002,113,536
9Jul 20, 2026 18:324,79349,316,10938,657,0001,129,0002,113,536