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 21, 2026 14:05Victor MerckléVictor MerckléScore: 4,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 14:064,67247,696,86037,718,0001,061,0002,113,536
2May 21, 2026 14:064,67446,683,63037,746,0001,056,0002,113,536
3May 21, 2026 14:064,68546,735,79137,824,0001,063,0002,113,536
4May 21, 2026 14:064,69046,908,31137,860,0001,070,0002,113,536
5May 21, 2026 14:064,69146,867,15937,879,0001,058,0002,113,536
6May 21, 2026 14:064,70646,929,50138,057,0001,005,0002,113,536
7May 21, 2026 14:064,70949,125,90738,014,0001,077,0002,113,536
8May 21, 2026 14:064,74248,166,30938,293,0001,072,0002,113,536
9May 21, 2026 14:064,77447,521,37538,558,0001,068,0002,113,536