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 listAug 3, 2026 18:15boop34boop34Score: 8,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 18:158,91585,129,98772,798,0001,204,0002,113,536
2Aug 3, 2026 18:158,92184,637,81272,844,0001,203,0002,113,536
3Aug 3, 2026 18:158,92588,422,16372,888,0001,193,0002,113,536
4Aug 3, 2026 18:158,92587,244,06172,942,0001,138,0002,113,536
5Aug 3, 2026 18:158,92883,999,17972,992,0001,112,0002,113,536
6Aug 3, 2026 18:158,93284,101,97772,870,0001,267,0002,113,536
7Aug 3, 2026 18:158,93284,044,45672,923,0001,217,0002,113,536
8Aug 3, 2026 18:158,94584,059,48373,105,0001,146,0002,113,536
9Aug 3, 2026 18:158,97984,448,88073,371,0001,159,0002,113,536