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 listAug 27, 2026 16:50Victor MerckléVictor MerckléScore: 3,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:513,84340,237,70230,870,0001,027,0002,113,536
2Aug 27, 2026 16:513,85641,063,24930,961,0001,051,0002,113,536
3Aug 27, 2026 16:513,87451,217,07631,137,0001,025,0002,113,536
4Aug 27, 2026 16:513,95747,797,12831,827,0001,022,0002,113,536
5Aug 27, 2026 16:513,99542,628,26432,115,0001,045,0002,113,536
6Aug 27, 2026 16:514,01147,587,07232,273,0001,023,0002,113,536
7Aug 27, 2026 16:514,02341,742,74732,374,0001,024,0002,113,536
8Aug 27, 2026 16:514,03242,440,45932,446,0001,022,0002,113,536
9Aug 27, 2026 16:514,17853,340,62433,647,0001,032,0002,113,536