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 2, 2026 15:17caandocaandoScore: 5,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:175,83676,191,85647,426,0001,009,0002,285,568
2Mar 2, 2026 15:175,83771,604,75147,437,0001,009,0002,523,136
3Mar 2, 2026 15:175,84077,142,62947,460,0001,009,0002,285,568
4Mar 2, 2026 15:175,92272,991,15547,143,0002,006,0002,285,568
5Mar 2, 2026 15:175,94671,716,42848,342,0001,007,0002,285,568
6Mar 2, 2026 15:175,96376,257,54148,483,0001,010,0002,359,296