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 12, 2025 12:15Aliaksandr MikheiAliaksandr MikheiScore: 76,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 12:1575,754649,512,164567,783,00060,976,0002,285,568
2Nov 12, 2025 12:1575,903651,356,511574,995,00054,999,0002,285,568
3Nov 12, 2025 12:1575,906654,810,675570,020,00060,002,0002,285,568
4Nov 12, 2025 12:1576,907668,476,121578,299,00060,031,0002,285,568
5Nov 12, 2025 12:1577,020669,182,489576,241,00063,026,0002,285,568
6Nov 12, 2025 12:1577,074662,061,938592,735,00046,979,0002,285,568