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 26, 2025 18:50hunaphuhunaphuScore: 52,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 18:5052,743463,273,263379,802,00057,969,0002,281,472
2Dec 26, 2025 18:5052,799462,565,328378,201,00060,032,0002,273,280
3Dec 26, 2025 18:5052,802464,281,073380,221,00058,033,0002,510,848
4Dec 26, 2025 18:5052,857464,219,829376,753,00061,959,0002,400,256
5Dec 26, 2025 18:5052,864461,464,500378,803,00059,968,0002,273,280
6Dec 26, 2025 18:5052,885460,451,945380,954,00057,993,0002,404,352
7Dec 26, 2025 18:5052,922469,466,956381,221,00058,033,0002,273,280
8Dec 26, 2025 18:5052,979462,568,319378,766,00060,962,0002,273,280
9Dec 26, 2025 18:5053,117463,164,602376,888,00063,981,0002,404,352