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 22:41Victor MerckléVictor MerckléScore: 4,136Success
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 22:424,10442,472,37432,953,0001,112,0002,117,632stderr
2Aug 11, 2026 22:424,11242,490,58033,095,0001,042,0002,117,632stderr
3Aug 11, 2026 22:424,11842,564,47433,150,0001,030,0002,117,632stderr
4Aug 11, 2026 22:424,12042,577,94233,177,0001,022,0002,117,632stderr
5Aug 11, 2026 22:424,13642,784,59233,243,0001,090,0002,117,632stderr
6Aug 11, 2026 22:424,14042,817,09333,232,0001,134,0002,117,632stderr
7Aug 11, 2026 22:424,14042,742,55533,325,0001,041,0002,117,632stderr
8Aug 11, 2026 22:424,14042,773,12833,222,0001,140,0002,117,632stderr
9Aug 11, 2026 22:424,17243,018,66533,604,0001,031,0002,117,632stderr