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 15, 2026 02:10Josu San MartinJosu San MartinScore: 387,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 02:10382,43113,127,387,007469,522,0002,704,654,000229,376
2Jan 15, 2026 02:10387,87912,489,976,239506,534,0002,712,861,000282,624
3Jan 15, 2026 02:10395,44112,911,392,619531,289,0002,750,874,000241,664