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 19:39Victor MerckléVictor MerckléScore: 3,876Success
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 19:403,85440,446,94630,768,0001,227,0002,117,632stderr
2Aug 11, 2026 19:403,85740,472,55930,964,0001,055,0002,117,632stderr
3Aug 11, 2026 19:403,86340,419,05331,023,0001,047,0002,117,632stderr
4Aug 11, 2026 19:403,86540,438,74931,047,0001,039,0002,117,632stderr
5Aug 11, 2026 19:403,87640,563,12531,053,0001,122,0002,117,632stderr
6Aug 11, 2026 19:403,89040,765,76931,205,0001,090,0002,117,632stderr
7Aug 11, 2026 19:403,91940,910,90031,475,0001,056,0002,117,632stderr
8Aug 11, 2026 19:404,03543,266,64932,380,0001,114,0002,117,632stderr
9Aug 11, 2026 19:404,05342,041,03532,569,0001,074,0002,117,632stderr