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 5, 2025 12:24caandocaandoScore: 5,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 12:185,54668,913,68744,032,0002,001,0002,285,568
2Nov 5, 2025 12:245,59168,012,65046,404,00002,285,568
3Nov 5, 2025 12:245,59471,401,80845,421,0001,009,0002,285,568
4Nov 5, 2025 12:185,59968,242,53645,463,0001,010,0002,523,136
5Nov 5, 2025 12:245,60165,309,68646,487,00002,523,136
6Nov 5, 2025 12:185,61477,225,42745,584,0001,012,0002,285,568
7Nov 5, 2025 12:245,68768,545,83745,190,0002,008,0002,523,136
8Nov 5, 2025 12:185,72471,033,90347,512,00002,285,568
9Nov 5, 2025 12:185,72669,265,87346,518,0001,011,0002,265,088
10Nov 5, 2025 12:245,74373,382,13046,655,0001,014,0002,285,568
11Nov 5, 2025 12:185,76278,486,09345,836,0001,992,0002,269,184
12Nov 5, 2025 12:245,76481,502,08145,849,0001,993,0002,523,136