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 listMar 14, 2026 21:52Ondřej PolaneckýOndřej PolaneckýScore: 40,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:5240,406371,383,218334,372,0001,001,0002,400,256
2Mar 14, 2026 21:5240,409360,208,915334,397,0001,001,0002,404,352
3Mar 14, 2026 21:5240,414361,632,933334,432,0001,001,0002,273,280
4Mar 14, 2026 21:5240,422359,584,630333,503,0001,997,0002,387,968
5Mar 14, 2026 21:5240,438361,682,955333,635,0001,997,0002,273,280
6Mar 14, 2026 21:5240,441362,034,217334,665,000999,0002,514,944
7Mar 14, 2026 21:5240,442362,938,592334,670,000999,0002,273,280
8Mar 14, 2026 21:5240,586361,458,701335,868,000999,0002,273,280
9Mar 14, 2026 21:5240,590362,702,023335,894,000999,0002,273,280