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 6, 2026 11:46Kevin HeaveyKevin HeaveyScore: 3,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:473,54039,359,77928,257,0001,131,0002,113,536
2Sep 6, 2026 11:473,57739,698,69128,554,0001,142,0002,113,536
3Sep 6, 2026 11:473,58339,882,46928,545,0001,198,0002,113,536
4Sep 6, 2026 11:473,60539,968,45428,775,0001,154,0002,113,536
5Sep 6, 2026 11:473,65640,459,47429,158,0001,190,0002,113,536
6Sep 6, 2026 11:473,75941,260,30030,028,0001,172,0002,113,536
7Sep 6, 2026 11:473,79341,523,39130,333,0001,149,0002,113,536
8Sep 6, 2026 11:473,85542,066,15530,844,0001,156,0002,113,536
9Sep 6, 2026 11:473,88442,338,58831,085,0001,156,0002,113,536