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 13:38Victor MerckléVictor MerckléScore: 4,674Success
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 13:394,64746,618,87237,512,0001,060,0002,113,536
2May 21, 2026 13:394,65448,032,21937,577,0001,052,0002,113,536
3May 21, 2026 13:394,65747,317,09737,650,0001,005,0002,113,536
4May 21, 2026 13:394,66149,370,24737,630,0001,061,0002,113,536
5May 21, 2026 13:394,67449,573,82937,791,0001,008,0002,113,536
6May 21, 2026 13:394,68148,687,37137,852,0001,006,0002,113,536
7May 21, 2026 13:394,68747,267,66137,843,0001,064,0002,113,536
8May 21, 2026 13:394,69148,415,96137,905,0001,031,0002,113,536
9May 21, 2026 13:394,69548,775,74537,959,0001,017,0002,113,536