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:49Priyanshu GuptaPriyanshu GuptaScore: 73,349Success
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:4973,329631,089,491549,664,00058,963,0002,285,568
2Oct 24, 2025 10:4973,337632,427,687551,722,00056,971,0002,260,992
3Oct 24, 2025 10:4973,347630,650,073553,797,00054,979,0002,269,184
4Oct 24, 2025 10:4973,349632,170,559549,814,00058,980,0002,285,568
5Oct 24, 2025 10:4973,349632,822,862550,818,00057,980,0002,285,568
6Oct 24, 2025 10:4973,372631,908,845551,988,00056,998,0002,285,568
7Oct 24, 2025 10:4973,420639,167,946545,346,00064,040,0002,260,992
8Oct 24, 2025 10:4973,421634,738,768552,450,00056,943,0002,285,568
9Oct 24, 2025 10:4973,645636,751,158550,225,00061,025,0002,523,136