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 11, 2026 12:51Victor MerckléVictor MerckléScore: 3,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 12:513,88140,468,18831,079,0001,134,0002,117,632stderr
2Aug 11, 2026 12:513,89040,576,68131,093,0001,195,0002,117,632stderr
3Aug 11, 2026 12:513,90240,829,94031,117,0001,272,0002,117,632stderr
4Aug 11, 2026 12:513,90540,864,90031,197,0001,217,0002,117,632stderr
5Aug 11, 2026 12:513,92041,590,99931,518,0001,018,0002,117,632stderr
6Aug 11, 2026 12:513,92440,899,24231,455,0001,117,0002,117,632stderr
7Aug 11, 2026 12:513,97141,241,99531,852,0001,108,0002,117,632stderr
8Aug 11, 2026 12:513,97241,467,77731,866,0001,108,0002,117,632stderr
9Aug 11, 2026 12:514,26143,682,44334,274,0001,097,0002,117,632stderr