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 listOct 17, 2026 09:52KacpxerKacpxerScore: 5,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 09:525,09653,167,00341,252,0001,051,0002,117,632
2Oct 17, 2026 09:525,09953,219,15541,284,0001,045,0002,117,632
3Oct 17, 2026 09:525,10653,795,47341,336,0001,044,0002,117,632
4Oct 17, 2026 09:525,10653,261,53541,346,0001,038,0002,117,632
5Oct 17, 2026 09:525,11953,497,72241,427,0001,061,0002,117,632
6Oct 17, 2026 09:525,16153,694,04941,787,0001,051,0002,117,632
7Oct 17, 2026 09:525,16653,761,94341,829,0001,051,0002,117,632
8Oct 17, 2026 09:525,17053,719,18241,873,0001,045,0002,117,632
9Oct 17, 2026 09:525,17953,891,35141,947,0001,046,0002,117,632