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 12, 2026 02:12Victor MerckléVictor MerckléScore: 3,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 02:133,75139,542,93629,987,0001,147,0002,117,632stderr
2Aug 12, 2026 02:133,75339,541,77929,975,0001,175,0002,117,632stderr
3Aug 12, 2026 02:133,75540,277,28230,003,0001,170,0002,117,632stderr
4Aug 12, 2026 02:133,78139,777,93630,319,0001,069,0002,117,632stderr
5Aug 12, 2026 02:133,78739,827,39830,349,0001,086,0002,117,632stderr
6Aug 12, 2026 02:133,80440,098,01030,399,0001,179,0002,117,632stderr
7Aug 12, 2026 02:133,81440,051,61330,450,0001,212,0002,117,632stderr
8Aug 12, 2026 02:133,89540,756,98431,284,0001,047,0002,117,632stderr
9Aug 12, 2026 02:133,93542,219,68531,548,0001,120,0002,117,632stderr