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 23, 2025 08:45Tan Lip WeiTan Lip WeiScore: 45,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 08:4545,717407,073,638378,451,0001,001,0002,519,040
2Oct 23, 2025 08:4545,717408,610,808378,449,0001,001,0002,285,568
3Oct 23, 2025 08:4545,731404,282,413377,573,0001,997,0002,285,568
4Oct 23, 2025 08:4545,733410,734,990377,585,0001,997,0002,285,568
5Oct 23, 2025 08:4545,741408,312,863378,649,000999,0002,285,568
6Oct 23, 2025 08:4545,742414,776,019377,663,0001,998,0002,285,568
7Oct 23, 2025 08:4545,744408,795,333377,681,0001,998,0002,285,568
8Oct 23, 2025 08:4545,755404,786,701377,772,0001,998,0002,355,200
9Oct 23, 2025 08:4545,759402,809,174377,800,0001,998,0002,285,568