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 listAug 6, 2026 00:49TonyTonyScore: 8,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 00:508,08777,107,71865,058,0002,067,0002,113,536
2Aug 6, 2026 00:508,10678,076,91765,041,0002,246,0002,113,536
3Aug 6, 2026 00:508,12977,487,49965,366,0002,112,0002,113,536
4Aug 6, 2026 00:508,13178,224,76265,357,0002,131,0002,113,536
5Aug 6, 2026 00:508,14377,676,49465,493,0002,099,0002,113,536
6Aug 6, 2026 00:508,15177,780,54165,562,0002,092,0002,113,536
7Aug 6, 2026 00:508,18778,756,28365,849,0002,104,0002,113,536
8Aug 6, 2026 00:508,19078,694,41765,903,0002,074,0002,113,536
9Aug 6, 2026 00:508,42479,944,44167,178,0002,748,0002,113,536