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 listFeb 18, 2026 10:03wnwnScore: 7,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:036,36077,705,46849,803,0002,988,0002,379,776
2Feb 18, 2026 10:036,36580,463,49450,840,0001,993,0002,424,832
3Feb 18, 2026 10:036,48180,667,42050,805,0002,988,0002,478,080
4Feb 18, 2026 10:037,18698,748,40656,615,0003,032,0002,510,848
5Feb 18, 2026 10:037,28285,626,04757,416,0003,021,0002,510,848
6Feb 18, 2026 10:037,32487,612,86356,802,0003,986,0002,347,008