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 listMay 13, 2026 18:46M-RochatM-RochatScore: 32,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:4732,640279,703,955269,901,0001,015,0002,113,536
2May 13, 2026 18:4732,643282,549,379269,907,0001,033,0002,113,536
3May 13, 2026 18:4732,644279,629,544269,930,0001,019,0002,113,536
4May 13, 2026 18:4732,663281,816,597270,015,0001,091,0002,113,536
5May 13, 2026 18:4732,680279,940,306270,210,0001,034,0002,113,536
6May 13, 2026 18:4732,708282,081,089270,424,0001,060,0002,113,536
7May 13, 2026 18:4732,723280,323,814270,587,0001,019,0002,113,536
8May 13, 2026 18:4732,740282,246,307270,700,0001,046,0002,113,536
9May 13, 2026 18:4732,762280,685,322270,828,0001,098,0002,113,536