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 24, 2026 19:43Victor MerckléVictor MerckléScore: 3,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:443,82640,178,78930,659,0001,101,0002,117,632stderr
2Aug 24, 2026 19:443,85840,445,73230,854,0001,171,0002,117,632stderr
3Aug 24, 2026 19:443,86440,446,87131,006,0001,071,0002,117,632stderr
4Aug 24, 2026 19:443,86440,442,31630,958,0001,120,0002,117,632stderr
5Aug 24, 2026 19:443,87540,620,88431,104,0001,064,0002,117,632stderr
6Aug 24, 2026 19:443,88040,631,65031,090,0001,116,0002,117,632stderr
7Aug 24, 2026 19:443,89540,683,58531,255,0001,081,0002,117,632stderr
8Aug 24, 2026 19:443,92340,949,54331,516,0001,045,0002,117,632stderr
9Aug 24, 2026 19:444,06742,131,53332,617,0001,143,0002,117,632stderr