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 13, 2026 12:23Eric CeglieEric CeglieScore: 35,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 12:2335,531320,124,624292,906,0001,999,0002,260,992
2Mar 13, 2026 12:2335,533320,285,629293,924,000999,0002,514,944
3Mar 13, 2026 12:2335,536321,038,592292,949,0001,999,0002,260,992
4Mar 13, 2026 12:2335,541319,840,597293,991,000996,0002,375,680
5Mar 13, 2026 12:2335,541324,241,341293,991,000999,0002,260,992
6Mar 13, 2026 12:2335,549318,920,549293,057,0002,000,0002,256,896
7Mar 13, 2026 12:2335,554321,306,203293,098,0002,000,0002,256,896
8Mar 13, 2026 12:2335,554322,418,004295,102,00002,392,064
9Mar 13, 2026 12:2335,570316,092,928294,235,0001,000,0002,256,896