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 listSep 24, 2026 03:20wnwnScore: 3,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:243,49037,765,97427,262,0001,706,00020,480
2Sep 24, 2026 03:243,52738,029,29027,582,0001,696,00020,480
3Sep 24, 2026 03:243,57438,458,68127,693,0001,975,0002,113,536
4Sep 24, 2026 03:243,61238,769,51426,824,0003,163,0002,113,536
5Sep 24, 2026 03:243,64638,955,07727,100,0003,168,0002,113,536
6Sep 24, 2026 03:243,64739,020,81828,539,0001,734,0002,113,536
7Sep 24, 2026 03:243,65539,136,34527,074,0003,265,0002,113,536
8Sep 24, 2026 03:243,75839,993,04729,296,0001,898,0002,113,536
9Sep 24, 2026 03:243,76340,642,71729,344,0001,893,0002,113,536