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 20, 2026 20:46Yash KodesiaYash KodesiaScore: 2,028,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 20:462,025,29516,847,208,98116,737,983,00071,965,0002,293,760
2Feb 20, 2026 20:462,025,32516,843,083,29316,739,233,00070,967,0002,281,472
3Feb 20, 2026 20:462,026,62216,851,599,44516,738,994,00081,965,0002,281,472
4Feb 20, 2026 20:462,026,85616,856,116,92016,753,931,00068,970,0002,281,472
5Feb 20, 2026 20:462,028,96216,872,769,63816,778,420,00061,964,0002,281,472
6Feb 20, 2026 20:462,031,56116,890,582,12716,785,990,00075,968,0002,281,472
7Feb 20, 2026 20:462,037,59116,948,267,64416,845,030,00066,972,0002,281,472
8Feb 20, 2026 20:462,040,31616,964,067,89616,852,665,00081,959,0002,281,472
9Feb 20, 2026 20:462,065,18517,169,637,46617,066,069,00074,965,0002,514,944