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:32caandocaandoScore: 5,913Success
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:325,81479,013,29046,243,0002,010,0002,269,184
2Nov 4, 2025 18:325,84470,514,24847,496,0001,010,0002,285,568
3Nov 4, 2025 18:325,88372,913,39146,835,0001,993,0002,519,040
4Nov 4, 2025 18:325,91373,172,08347,075,0002,003,0002,265,088
5Nov 4, 2025 18:326,01272,532,45247,901,0001,995,0002,285,568
6Nov 4, 2025 18:326,02370,636,78947,994,0001,999,0002,285,568