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 17, 2026 13:28Andrew EpsteinAndrew EpsteinScore: 9,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 13:349,78690,045,64780,156,0001,072,0002,117,632stderr
2Sep 17, 2026 13:349,79390,019,46780,194,0001,096,0002,117,632stderr
3Sep 17, 2026 13:349,80790,129,09080,340,0001,059,0002,117,632stderr
4Sep 17, 2026 13:349,87190,697,35980,871,0001,061,0002,117,632stderr
5Sep 17, 2026 13:349,91391,050,20481,230,0001,055,0002,117,632stderr
6Sep 17, 2026 13:349,91691,032,18181,254,0001,050,0002,117,632stderr
7Sep 17, 2026 13:349,98293,348,11881,697,0001,156,0002,117,632stderr
8Sep 17, 2026 13:349,99391,721,43881,867,0001,077,0002,117,632stderr
9Sep 17, 2026 13:3410,00591,776,68081,975,0001,067,0002,117,632stderr