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 4, 2026 07:43Victor MerckléVictor MerckléScore: 3,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:533,63538,473,24129,027,0001,150,0002,117,632stderr
2Sep 4, 2026 07:533,64238,648,38029,066,0001,169,0002,117,632stderr
3Sep 4, 2026 07:533,65338,741,87429,208,0001,117,0002,117,632stderr
4Sep 4, 2026 07:533,67038,884,79529,162,0001,301,0002,117,632stderr
5Sep 4, 2026 07:533,67838,968,22829,407,0001,125,0002,117,632stderr
6Sep 4, 2026 07:533,68038,914,62729,457,0001,093,0002,117,632stderr
7Sep 4, 2026 07:533,68239,001,57329,493,0001,074,0002,117,632stderr
8Sep 4, 2026 07:533,68439,167,21929,453,0001,130,0002,117,632stderr
9Sep 4, 2026 07:533,70939,763,06229,547,0001,238,0002,117,632stderr