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 listMay 11, 2026 03:53Josu San MartinJosu San MartinScore: 3,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 03:533,86539,782,93630,991,0001,092,0002,113,536
2May 11, 2026 03:533,87542,309,64831,095,0001,075,0002,113,536
3May 11, 2026 03:533,88341,719,32531,165,0001,069,0002,113,536
4May 11, 2026 03:533,89039,987,18931,208,0001,086,0002,113,536
5May 11, 2026 03:533,89141,119,02731,207,0001,093,0002,113,536
6May 11, 2026 03:533,89642,129,69431,257,0001,081,0002,113,536
7May 11, 2026 03:533,90440,135,81931,317,0001,093,0002,113,536
8May 11, 2026 03:533,91040,478,92331,379,0001,077,0002,113,536
9May 11, 2026 03:533,91040,217,22431,376,0001,079,0002,113,536