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 9, 2025 20:20pseppsepScore: 59,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 20:2059,054511,941,562448,137,00042,012,0002,289,664
2Dec 9, 2025 20:2059,057513,164,536439,158,00051,018,0002,285,568
3Dec 9, 2025 20:2059,097520,162,098441,553,00048,950,0002,519,040
4Dec 9, 2025 20:2059,105523,351,987439,618,00050,955,0002,277,376
5Dec 9, 2025 20:2059,127515,400,384445,777,00044,977,0002,269,184
6Dec 9, 2025 20:2059,273517,737,637443,967,00047,996,0002,285,568
7Dec 9, 2025 20:2059,347523,387,645446,617,00045,960,0002,322,432
8Dec 9, 2025 20:2059,352515,768,985451,650,00040,968,0002,265,088
9Dec 9, 2025 20:2059,420517,345,298444,166,00049,018,0002,285,568