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 21, 2026 21:54M-RochatM-RochatScore: 6,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:546,57766,041,61052,564,0002,026,0002,113,536
2May 21, 2026 21:546,58965,953,51652,627,0002,068,0002,113,536
3May 21, 2026 21:546,59065,088,98752,635,0002,067,0002,113,536
4May 21, 2026 21:546,59667,041,86652,681,0002,072,0002,113,536
5May 21, 2026 21:546,61166,168,95452,815,0002,060,0002,113,536
6May 21, 2026 21:546,61566,434,20852,805,0002,100,0002,113,536
7May 21, 2026 21:546,63267,215,15152,883,0002,166,0002,113,536
8May 21, 2026 21:546,71466,489,54253,551,0002,182,0002,113,536
9May 21, 2026 21:546,72668,904,07553,648,0002,181,0002,113,536