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 15, 2026 03:53Victor MerckléVictor MerckléScore: 6,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 03:546,96265,813,97156,754,0001,035,0002,113,536
2May 15, 2026 03:546,96866,968,22656,838,0001,003,0002,113,536
3May 15, 2026 03:546,96965,211,40957,845,00002,113,536
4May 15, 2026 03:546,97066,792,57057,857,00002,113,536
5May 15, 2026 03:546,97367,126,06257,881,00002,113,536
6May 15, 2026 03:546,97565,843,20656,891,0001,003,0002,113,536
7May 15, 2026 03:546,97566,865,30557,899,00002,113,536
8May 15, 2026 03:546,98567,159,23456,973,0001,009,0002,113,536
9May 15, 2026 03:547,01866,937,88157,208,0001,043,0002,113,536