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:44Victor MerckléVictor MerckléScore: 4,609Success
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:454,50045,747,73636,243,0001,115,0002,117,632stderr
2Aug 11, 2026 12:454,58547,534,44336,942,0001,116,0002,117,632stderr
3Aug 11, 2026 12:454,59546,553,58737,133,0001,009,0002,117,632stderr
4Aug 11, 2026 12:454,59946,577,67637,080,0001,092,0002,117,632stderr
5Aug 11, 2026 12:454,60947,242,87237,225,0001,030,0002,117,632stderr
6Aug 11, 2026 12:454,62946,824,12837,402,0001,026,0002,117,632stderr
7Aug 11, 2026 12:454,68747,326,44037,890,0001,015,0002,117,632stderr
8Aug 11, 2026 12:454,71047,899,72038,082,0001,018,0002,117,632stderr
9Aug 11, 2026 12:454,95149,521,92640,048,0001,050,0002,117,632stderr