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 5, 2026 04:07Josu San MartinJosu San MartinScore: 5,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:075,78768,635,37246,032,0002,001,0002,281,472
2Feb 5, 2026 04:085,78771,536,33746,028,0002,001,0002,273,280
3Feb 5, 2026 04:075,78970,017,09746,045,0002,001,0002,531,328
4Feb 5, 2026 04:075,79570,286,10946,097,0002,004,0002,285,568
5Feb 5, 2026 04:085,84571,162,02147,502,0001,010,0002,428,928
6Feb 5, 2026 04:075,85479,049,96547,578,0001,012,0002,441,216
7Feb 5, 2026 04:085,86478,304,33347,679,000993,0002,441,216
8Feb 5, 2026 04:075,88077,387,99347,812,000996,0002,281,472
9Feb 5, 2026 04:085,88669,985,54746,861,0001,994,0002,285,568
10Feb 5, 2026 04:085,89974,213,29946,967,0001,998,0002,285,568
11Feb 5, 2026 04:075,91069,857,89947,051,0002,002,0002,285,568
12Feb 5, 2026 04:085,91170,937,90347,063,0002,002,0002,285,568