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 11:32Victor MerckléVictor MerckléScore: 6,968Success
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 11:326,96267,900,53857,785,00002,113,536
2May 15, 2026 11:326,96765,927,34957,831,00002,113,536
3May 15, 2026 11:326,96765,647,10657,827,00002,113,536
4May 15, 2026 11:326,96865,168,58856,827,0001,010,0002,113,536
5May 15, 2026 11:326,96866,761,21956,834,0001,007,0002,113,536
6May 15, 2026 11:326,96965,135,94257,844,00002,113,536
7May 15, 2026 11:326,97067,499,60557,852,00002,113,536
8May 15, 2026 11:327,01767,651,09358,244,00002,113,536
9May 15, 2026 11:327,03565,669,22258,397,00002,113,536