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 17, 2026 23:38Aleksei ShahoikaAleksei ShahoikaScore: 12,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 23:4312,659115,166,43583,088,00021,982,0002,113,536
2May 17, 2026 23:4312,727116,826,16283,432,00022,209,0002,113,536
3May 17, 2026 23:4312,741115,672,29583,475,00022,281,0002,113,536
4May 17, 2026 23:4312,777117,900,80483,487,00022,568,0002,113,536
5May 17, 2026 23:4312,791115,551,42983,449,00022,719,0002,113,536
6May 17, 2026 23:4312,799116,090,79283,759,00022,476,0002,113,536
7May 17, 2026 23:4312,893116,359,75283,255,00023,763,0002,113,536
8May 17, 2026 23:4312,956118,875,65483,352,00024,184,0002,113,536
9May 17, 2026 23:4313,012119,128,87283,347,00024,658,0002,113,536