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 listFeb 18, 2026 22:08Mikołaj UzarskiMikołaj UzarskiScore: 5,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:085,78270,731,94440,993,0006,998,0002,437,120
2Feb 18, 2026 22:085,78771,432,28143,032,0005,003,0002,355,200
3Feb 18, 2026 22:105,79870,425,40644,116,0004,010,0002,392,064
4Feb 18, 2026 22:085,84776,954,20842,462,0006,066,0002,437,120
5Feb 18, 2026 22:105,87378,331,20641,781,0006,963,0002,322,432
6Feb 18, 2026 22:105,98476,999,22242,713,0006,953,0002,428,928