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 listMar 20, 2026 14:58lmqzzzlmqzzzScore: 2,068,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 14:582,066,55417,182,431,00317,091,426,00060,969,0002,277,376
2Mar 20, 2026 14:582,066,65817,190,129,45417,085,298,00067,965,0002,265,088
3Mar 20, 2026 14:582,067,36117,189,281,83817,086,125,00072,970,0002,277,376
4Mar 20, 2026 14:582,067,36417,188,958,54617,084,162,00074,961,0002,277,376
5Mar 20, 2026 14:582,068,29417,196,777,45317,102,861,00063,977,0002,277,376
6Mar 20, 2026 14:582,068,49817,202,107,10517,111,559,00056,971,0002,277,376
7Mar 20, 2026 14:582,068,96217,208,770,11917,102,421,00069,964,0002,285,568
8Mar 20, 2026 14:582,069,11317,202,667,33417,106,660,00066,975,0002,277,376
9Mar 20, 2026 14:582,071,79217,228,430,80517,115,912,00079,962,0002,289,664