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 25, 2026 19:36Daniel MastalerzDaniel MastalerzScore: 5,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 19:365,53666,607,65944,949,000998,0002,424,832
2Feb 25, 2026 19:365,53972,145,53142,976,0002,998,0002,420,736
3Feb 25, 2026 19:365,53972,519,79743,974,0001,998,0002,281,472
4Feb 25, 2026 19:365,64477,076,10543,857,0002,990,0002,420,736
5Feb 25, 2026 19:365,64673,380,44544,869,0001,994,0002,260,992
6Feb 25, 2026 19:365,67072,456,42745,062,0002,002,0002,428,928