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 listOct 24, 2025 10:51Priyanshu GuptaPriyanshu GuptaScore: 73,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 10:5173,844639,629,917556,916,00055,991,0002,285,568
2Oct 24, 2025 10:5173,926637,214,534549,629,00063,956,0002,277,376
3Oct 24, 2025 10:5173,946638,408,399552,774,00060,975,0002,265,088