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,655Success
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,51976,094,28844,815,000995,0002,269,184
2Mar 2, 2026 15:175,59071,282,78745,393,0001,008,0002,527,232
3Mar 2, 2026 15:175,64077,469,75245,815,000995,0002,523,136
4Mar 2, 2026 15:175,65571,218,83045,938,000998,0002,265,088
5Mar 2, 2026 15:175,67170,804,19545,069,0002,003,0002,285,568
6Mar 2, 2026 15:175,68468,978,80245,171,0002,007,0002,273,280