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 28, 2026 08:09Victor MerckléVictor MerckléScore: 141,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 08:10139,4181,167,109,6791,156,174,0001,002,0002,117,632stderr
2Aug 28, 2026 08:10140,4061,175,379,0061,164,376,0001,002,0002,117,632stderr
3Aug 28, 2026 08:10140,9661,179,947,6811,169,019,0001,002,0002,117,632stderr
4Aug 28, 2026 08:10141,3841,190,040,2271,172,491,0001,000,0002,117,632stderr
5Aug 28, 2026 08:10141,6251,186,484,2241,174,490,0001,001,0002,117,632stderr
6Aug 28, 2026 08:10141,8171,208,173,6951,174,999,0002,088,0002,117,632stderr
7Aug 28, 2026 08:10142,0431,197,632,4981,177,956,0001,002,0002,117,632stderr
8Aug 28, 2026 08:10142,0451,195,550,7531,177,980,0001,000,0002,117,632stderr
9Aug 28, 2026 08:10142,2681,202,070,0401,176,822,0004,003,0002,117,632stderr