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 23:04Victor MerckléVictor MerckléScore: 4,024Success
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 23:053,97941,468,14831,857,0001,173,0002,117,632stderr
2Aug 11, 2026 23:053,98142,540,51731,860,0001,187,0002,117,632stderr
3Aug 11, 2026 23:054,00741,684,07032,237,0001,028,0002,117,632stderr
4Aug 11, 2026 23:054,01541,796,82532,241,0001,090,0002,117,632stderr
5Aug 11, 2026 23:054,02441,813,35032,368,0001,034,0002,117,632stderr
6Aug 11, 2026 23:054,03141,882,43232,433,0001,027,0002,117,632stderr
7Aug 11, 2026 23:054,04042,599,82232,400,0001,138,0002,117,632stderr
8Aug 11, 2026 23:054,16943,044,68333,537,0001,066,0002,117,632stderr
9Aug 11, 2026 23:054,19543,225,64733,695,0001,126,0002,117,632stderr