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:02Daniel MastalerzDaniel MastalerzScore: 7,214Success
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:027,03180,974,16855,341,0003,018,0002,326,528
2Feb 18, 2026 00:027,05084,854,29755,486,0003,026,0002,277,376
3Feb 18, 2026 00:027,06085,406,23656,582,0002,020,0002,326,528
4Feb 18, 2026 00:027,21481,071,98956,881,0002,993,0002,265,088
5Feb 18, 2026 00:027,21883,478,43056,918,0002,995,0002,260,992
6Feb 18, 2026 00:027,22184,728,08156,942,0002,996,0002,318,336