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 27, 2026 07:46Victor MerckléVictor MerckléScore: 3,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 07:463,85840,346,26430,932,0001,090,0002,117,632stderr
2Aug 27, 2026 07:463,85840,326,40630,871,0001,158,0002,117,632stderr
3Aug 27, 2026 07:463,85940,293,99230,889,0001,141,0002,117,632stderr
4Aug 27, 2026 07:463,89740,652,93831,224,0001,122,0002,117,632stderr
5Aug 27, 2026 07:463,90740,682,94931,313,0001,116,0002,117,632stderr
6Aug 27, 2026 07:464,02249,181,55532,212,0001,172,0002,117,632stderr
7Aug 27, 2026 07:464,03041,768,46932,361,0001,092,0002,117,632stderr
8Aug 27, 2026 07:464,06342,050,70032,634,0001,090,0002,117,632stderr
9Aug 27, 2026 07:464,12543,828,91533,140,0001,103,0002,117,632stderr