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 16:08Josu San MartinJosu San MartinScore: 11,249Success
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 16:089,220102,730,83275,518,0001,006,0002,281,472
2Mar 10, 2026 16:089,329101,497,99476,428,0001,005,0002,281,472
3Mar 10, 2026 16:089,370106,206,80976,776,000997,0002,281,472
4Mar 10, 2026 16:0811,249114,240,43592,365,0001,003,0002,281,472
5Mar 10, 2026 16:0811,329116,928,96492,028,0002,000,0002,281,472
6Mar 10, 2026 16:0811,608116,926,80395,345,0001,003,0002,281,472