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 00:00Daniel MastalerzDaniel MastalerzScore: 7,174Success
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 00:007,01385,326,78255,201,0003,010,0002,277,376
2Feb 18, 2026 00:007,01982,132,15754,239,0004,017,0002,306,048
3Feb 18, 2026 00:007,03379,597,67455,355,0003,019,0002,269,184
4Feb 18, 2026 00:007,17485,220,58257,528,0002,018,0002,269,184
5Feb 18, 2026 00:007,19085,767,68356,644,0003,034,0002,269,184
6Feb 18, 2026 00:007,22481,761,72456,963,0002,998,0002,265,088