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 listJan 2, 2026 19:02Josu San MartinJosu San MartinScore: 5,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 19:025,68572,724,04546,185,0001,004,0002,359,296
2Jan 2, 2026 19:025,68972,229,62345,212,0002,009,0002,289,664
3Jan 2, 2026 19:025,76376,109,21845,837,0001,992,0002,359,296
4Jan 2, 2026 19:025,76573,688,98445,858,0001,993,0002,285,568
5Jan 2, 2026 19:025,78778,180,53746,027,0002,001,0002,367,488
6Jan 2, 2026 19:025,80272,663,28346,147,0002,006,0002,285,568