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 11:49Aliaksandr MikheiAliaksandr MikheiScore: 92,713Success
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 11:4992,632790,814,305708,860,00059,988,0002,285,568
2Nov 12, 2025 11:4992,660797,108,529713,075,00056,005,0002,285,568
3Nov 12, 2025 11:4992,674798,731,789712,178,00057,014,0002,265,088
4Nov 12, 2025 11:4992,685797,762,393711,267,00058,021,0002,289,664
5Nov 12, 2025 11:4992,713798,491,782712,555,00056,964,0002,285,568
6Nov 12, 2025 11:4992,748799,500,945702,829,00066,983,0002,285,568
7Nov 12, 2025 11:4992,794799,721,232709,178,00061,015,0002,285,568
8Nov 12, 2025 11:4992,808798,608,744709,361,00060,945,0002,285,568
9Nov 12, 2025 11:4992,813793,503,823709,401,00060,948,0002,265,088