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 7, 2026 23:16Victor MerckléVictor MerckléScore: 4,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 23:183,97142,216,98228,866,0004,095,00024,576stderr
2Sep 7, 2026 23:183,97841,642,01628,824,0004,196,00024,576stderr
3Sep 7, 2026 23:183,98541,553,10328,648,0004,433,00024,576stderr
4Sep 7, 2026 23:183,98642,244,76528,759,0004,331,00024,576stderr
5Sep 7, 2026 23:184,02042,584,43628,859,0004,508,0002,117,632stderr
6Sep 7, 2026 23:184,05442,793,88228,829,0004,822,00024,576stderr
7Sep 7, 2026 23:184,06842,078,01128,695,0005,072,00024,576stderr
8Sep 7, 2026 23:184,08142,230,90728,746,0005,134,0002,117,632stderr
9Sep 7, 2026 23:184,09042,553,90428,833,0005,118,0002,117,632stderr