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 17, 2026 21:26zielajzielajScore: 3,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:263,29937,016,93326,360,0001,024,0002,113,536
2May 17, 2026 21:263,30535,186,08326,402,0001,035,0002,113,536
3May 17, 2026 21:263,31035,870,36226,462,0001,016,0002,113,536
4May 17, 2026 21:263,32436,738,84726,553,0001,038,0002,113,536
5May 17, 2026 21:263,33235,386,03826,630,0001,030,0002,113,536
6May 17, 2026 21:2659,335502,102,452491,453,0001,031,0002,113,536
7May 17, 2026 21:2659,637502,745,664493,967,0001,028,0002,113,536
8May 17, 2026 21:2659,825505,730,999495,523,0001,027,0002,113,536
9May 17, 2026 21:2661,179516,531,778506,699,0001,094,0002,113,536