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 listSep 8, 2026 09:20Victor MerckléVictor MerckléScore: 3,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 09:283,85740,511,77430,982,0001,036,0002,117,632stderr
2Sep 8, 2026 09:283,86640,648,77631,037,0001,051,0002,117,632stderr
3Sep 8, 2026 09:283,90340,898,62531,377,0001,018,0002,117,632stderr
4Sep 8, 2026 09:283,90840,876,35131,403,0001,035,0002,117,632stderr
5Sep 8, 2026 09:283,91041,641,53231,437,0001,017,0002,117,632stderr
6Sep 8, 2026 09:283,93942,200,40231,674,0001,020,0002,117,632stderr
7Sep 8, 2026 09:283,95741,373,12631,816,0001,035,0002,117,632stderr
8Sep 8, 2026 09:283,96741,440,68931,914,0001,020,0002,117,632stderr
9Sep 8, 2026 09:283,98441,679,06532,020,0001,051,0002,117,632stderr