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 19, 2025 17:51idatsyidatsyScore: 58,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 17:5158,099508,379,211420,193,00062,028,0002,277,376
2Dec 19, 2025 17:5158,150507,588,022417,696,00064,952,0002,277,376
3Dec 19, 2025 17:5158,154508,291,603417,724,00064,957,0002,277,376
4Dec 19, 2025 17:5158,198507,134,412414,038,00069,006,0002,277,376
5Dec 19, 2025 17:5158,233507,090,734419,288,00064,044,0002,277,376
6Dec 19, 2025 17:5158,252515,135,021414,419,00069,069,0002,277,376
7Dec 19, 2025 17:5158,289509,600,924416,826,00066,972,0002,277,376
8Dec 19, 2025 17:5158,353508,524,903414,282,00070,047,0002,351,104
9Dec 19, 2025 17:5158,392511,280,831415,702,00068,950,0002,277,376