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 16, 2026 18:49wnwnScore: 8,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:497,31990,841,94657,761,0002,987,0002,506,752
2Feb 16, 2026 18:497,36586,084,17657,125,0004,008,0002,478,080
3Feb 16, 2026 18:497,40384,605,75558,424,0003,021,0002,453,504
4Feb 16, 2026 18:498,35295,194,45066,309,0003,014,0002,510,848
5Feb 16, 2026 18:498,38093,670,75066,530,0003,024,0002,392,064
6Feb 16, 2026 18:498,780102,680,82169,878,0002,994,0002,445,312