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 19, 2026 23:18Daniel MastalerzDaniel MastalerzScore: 7,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:187,66294,898,85162,587,0001,009,0002,269,184
2Feb 19, 2026 23:187,68992,163,57961,827,0001,994,0002,265,088
3Feb 19, 2026 23:187,69487,324,62960,865,0002,993,0002,297,856
4Feb 19, 2026 23:187,81989,390,51161,900,0002,995,0002,293,760
5Feb 19, 2026 23:187,83787,410,26763,048,0002,001,0002,375,680
6Feb 19, 2026 23:187,84389,876,15862,093,0003,004,0002,293,760