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 listNov 4, 2025 18:20caandocaandoScore: 5,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 18:205,86770,208,69446,708,0001,987,0002,285,568
2Nov 4, 2025 18:205,91175,791,20547,058,0002,002,0002,285,568
3Nov 4, 2025 18:205,92178,047,80247,138,0002,005,0002,273,280
4Nov 4, 2025 18:205,94072,073,13247,294,0002,012,0002,277,376
5Nov 4, 2025 18:206,00178,142,60547,813,0001,992,0002,265,088
6Nov 4, 2025 18:206,08877,203,83749,517,0001,010,0002,285,568