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 listFeb 24, 2026 19:45Mikołaj UzarskiMikołaj UzarskiScore: 5,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:525,45866,825,51740,271,0005,033,0002,285,568
2Feb 24, 2026 19:525,47868,150,11740,413,0005,051,0002,445,312
3Feb 24, 2026 19:455,49476,533,72739,522,0006,080,0002,514,944
4Feb 24, 2026 19:455,49973,259,78840,570,0005,071,0002,514,944
5Feb 24, 2026 19:525,57970,217,89241,276,0005,033,0002,437,120
6Feb 24, 2026 19:455,65380,909,70340,933,0005,990,0002,457,600