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 13:12Victor MerckléVictor MerckléScore: 3,852Success
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 13:133,83640,201,12230,821,0001,026,0002,117,632stderr
2Aug 11, 2026 13:133,84740,300,57130,896,0001,036,0002,117,632stderr
3Aug 11, 2026 13:133,84940,344,62430,833,0001,115,0002,117,632stderr
4Aug 11, 2026 13:133,85040,392,78230,928,0001,033,0002,117,632stderr
5Aug 11, 2026 13:133,85240,400,00230,838,0001,135,0002,117,632stderr
6Aug 11, 2026 13:133,85340,398,58130,847,0001,136,0002,117,632stderr
7Aug 11, 2026 13:133,86240,482,46531,025,0001,037,0002,117,632stderr
8Aug 11, 2026 13:133,87140,562,47231,109,0001,022,0002,117,632stderr
9Aug 11, 2026 13:134,11042,493,13533,064,0001,049,0002,117,632stderr