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 26, 2025 10:32Tejas G.Tejas G.Score: 73,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2025 10:3273,230630,972,418606,810,000999,0002,285,568
2Oct 26, 2025 10:3273,246630,160,114606,945,000999,0002,285,568
3Oct 26, 2025 10:3273,252634,275,203605,994,0001,999,0002,285,568
4Oct 26, 2025 10:3273,256629,265,414607,021,0001,000,0002,396,160
5Oct 26, 2025 10:3273,263630,086,150608,082,00002,285,568
6Oct 26, 2025 10:3273,271628,746,525607,147,0001,000,0002,285,568
7Oct 26, 2025 10:3273,318637,264,872606,539,0001,998,0002,285,568
8Oct 26, 2025 10:3273,341635,930,266606,731,0001,999,0002,519,040
9Oct 26, 2025 10:3273,342634,516,865606,738,0001,999,0002,359,296