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 29, 2026 01:19Victor MerckléVictor MerckléScore: 5,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:204,98549,871,41740,316,0001,067,0002,117,632stderr
2Aug 29, 2026 01:204,99149,797,03940,374,0001,058,0002,117,632stderr
3Aug 29, 2026 01:205,04650,233,14340,831,0001,052,0002,117,632stderr
4Aug 29, 2026 01:205,06650,405,36340,995,0001,058,0002,117,632stderr
5Aug 29, 2026 01:205,14251,030,71641,637,0001,042,0002,117,632stderr
6Aug 29, 2026 01:205,15551,182,98741,768,0001,022,0002,117,632stderr
7Aug 29, 2026 01:205,19151,468,07642,061,0001,026,0002,117,632stderr
8Aug 29, 2026 01:205,19151,430,02042,069,0001,024,0002,117,632stderr
9Aug 29, 2026 01:205,20351,562,04342,142,0001,048,0002,117,632stderr