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 listMar 10, 2026 17:28Josu San MartinJosu San MartinScore: 5,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:285,01670,531,23940,621,0001,015,0002,281,472
2Mar 10, 2026 17:285,05668,530,04239,964,0001,998,0002,371,584
3Mar 10, 2026 17:285,16071,161,43840,837,0001,992,0002,281,472
4Mar 10, 2026 17:285,33066,681,83942,230,0002,010,0002,281,472
5Mar 10, 2026 17:285,34076,247,74143,319,0001,007,0002,281,472
6Mar 10, 2026 17:285,45073,994,82043,225,0002,010,0002,367,488