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 27, 2026 02:52Victor MerckléVictor MerckléScore: 4,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:534,08342,357,87132,758,0001,139,0002,117,632stderr
2Aug 27, 2026 02:534,09742,465,65432,924,0001,082,0002,117,632stderr
3Aug 27, 2026 02:534,10742,515,72232,960,0001,136,0002,117,632stderr
4Aug 27, 2026 02:534,12442,634,75933,156,0001,080,0002,117,632stderr
5Aug 27, 2026 02:534,14943,358,69033,328,0001,115,0002,117,632stderr
6Aug 27, 2026 02:534,15842,893,04133,331,0001,187,0002,117,632stderr
7Aug 27, 2026 02:534,16042,927,66433,433,0001,100,0002,117,632stderr
8Aug 27, 2026 02:534,16342,902,77433,464,0001,097,0002,117,632stderr
9Aug 27, 2026 02:534,29544,026,36434,587,0001,069,0002,117,632stderr