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 24, 2026 20:01Maya RebholzMaya RebholzScore: 8,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:018,15378,636,48762,553,0005,125,0002,113,536
2May 24, 2026 20:018,21379,169,09062,859,0005,309,0002,117,632
3May 24, 2026 20:018,22377,590,34462,964,0005,295,0002,117,632
4May 24, 2026 20:018,25680,127,21462,912,0005,613,0002,113,536
5May 24, 2026 20:018,28178,246,40163,207,0005,530,0002,117,632
6May 24, 2026 20:018,34279,301,02863,570,0005,674,0002,113,536
7May 24, 2026 20:018,50584,853,30664,695,0005,903,0002,113,536
8May 24, 2026 20:018,53086,996,12964,735,0006,065,0002,117,632
9May 24, 2026 20:018,60487,165,53064,095,0007,326,0002,113,536