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 24, 2026 16:38Victor MerckléVictor MerckléScore: 4,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 16:394,56547,532,25236,841,0001,054,0002,113,536
2May 24, 2026 16:394,56946,834,70136,845,0001,078,0002,113,536
3May 24, 2026 16:394,57245,800,68836,878,0001,075,0002,113,536
4May 24, 2026 16:394,57746,720,95836,923,0001,070,0002,113,536
5May 24, 2026 16:394,58647,626,83737,061,0001,007,0002,113,536
6May 24, 2026 16:394,58746,562,19137,018,0001,062,0002,113,536
7May 24, 2026 16:394,58845,888,36636,974,0001,114,0002,113,536
8May 24, 2026 16:394,77447,409,29738,554,0001,077,0002,113,536
9May 24, 2026 16:394,81347,839,42938,907,0001,042,0002,113,536