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 22:09Daniel MastalerzDaniel MastalerzScore: 5,895Success
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 22:095,80971,390,72444,195,0004,017,0002,330,624
2Feb 19, 2026 22:095,82371,056,03745,314,0003,020,0002,310,144
3Feb 19, 2026 22:095,88071,189,74944,820,0003,984,0002,330,624
4Feb 19, 2026 22:095,89571,006,94345,937,0002,995,0002,289,664
5Feb 19, 2026 22:095,91672,027,60245,093,0004,008,0002,306,048
6Feb 19, 2026 22:095,93271,427,20847,230,0002,009,0002,269,184