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 14, 2026 23:15Kevin HeaveyKevin HeaveyScore: 3,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:163,61939,682,67829,018,0001,024,0002,117,632
2Jul 14, 2026 23:163,64639,966,52329,222,0001,048,0002,117,632
3Jul 14, 2026 23:163,64839,911,27629,236,0001,050,0002,117,632
4Jul 14, 2026 23:163,65540,064,66829,295,0001,049,0002,117,632
5Jul 14, 2026 23:163,79941,225,32930,511,0001,024,0002,117,632
6Jul 14, 2026 23:163,84141,442,36630,837,0001,044,0002,117,632
7Jul 14, 2026 23:163,84741,496,66430,890,0001,045,0002,117,632
8Jul 14, 2026 23:163,86441,686,88631,034,0001,045,0002,117,632
9Jul 14, 2026 23:163,86941,672,18631,095,0001,022,0002,117,632