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:03Josu San MartinJosu San MartinScore: 5,787Success
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:035,52772,217,39543,882,0001,994,0002,289,664
2Jan 2, 2026 19:035,69072,336,34946,220,0001,004,0002,363,392
3Jan 2, 2026 19:035,76374,782,03546,834,000996,0002,281,472
4Jan 2, 2026 19:035,78772,664,25145,029,0003,001,0002,285,568
5Jan 2, 2026 19:035,79073,981,37446,059,0002,002,0002,363,392
6Jan 2, 2026 19:035,79579,856,31345,096,0003,006,0002,367,488