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 listDec 21, 2025 10:46Mark R BestMark R BestScore: 59,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 10:4659,833523,754,004423,673,00072,943,0002,289,664
2Dec 21, 2025 10:4659,863521,172,241414,884,00081,977,0002,289,664
3Dec 21, 2025 10:4659,887519,286,408434,051,00063,007,0002,359,296
4Dec 21, 2025 10:4659,909518,726,388425,210,00072,035,0002,285,568
5Dec 21, 2025 10:4659,922522,799,517420,295,00077,054,0002,281,472
6Dec 21, 2025 10:4659,926522,255,404436,339,00061,047,0002,289,664
7Dec 21, 2025 10:4659,935527,937,320434,402,00063,058,0002,289,664
8Dec 21, 2025 10:4659,976518,723,205422,828,00074,969,0002,289,664
9Dec 21, 2025 10:4660,047521,305,689432,342,00066,052,0002,371,584