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 20, 2026 10:40M-RochatM-RochatScore: 7,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:407,22869,477,81257,951,0002,049,0002,113,536
2May 20, 2026 10:407,24070,044,43557,975,0002,122,0002,113,536
3May 20, 2026 10:407,32772,272,04258,690,0002,132,0002,113,536
4May 20, 2026 10:407,32972,397,18358,724,0002,112,0002,113,536
5May 20, 2026 10:407,33272,817,63258,736,0002,125,0002,113,536
6May 20, 2026 10:407,33370,426,12258,732,0002,135,0002,113,536
7May 20, 2026 10:407,34470,357,93858,841,0002,116,0002,113,536
8May 20, 2026 10:407,35972,090,19558,905,0002,177,0002,113,536
9May 20, 2026 10:407,44671,288,39559,663,0002,141,0002,113,536