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 listMay 20, 2026 20:48Pavel KrajcevskiPavel KrajcevskiScore: 149,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 20:51148,1401,241,257,8641,224,553,0005,011,0002,134,016
2May 20, 2026 20:51149,2551,249,702,0181,233,488,0005,333,0002,134,016
3May 20, 2026 20:51149,6291,254,523,6771,236,917,0005,006,0002,134,016
4May 20, 2026 20:51149,6491,256,345,4681,237,091,0005,002,0002,134,016
5May 20, 2026 20:51149,9611,256,541,1531,239,676,0005,006,0002,134,016
6May 20, 2026 20:51150,3571,260,416,4301,242,959,0005,012,0002,134,016
7May 20, 2026 20:51154,2901,292,651,4951,274,594,0006,014,0002,134,016
8May 20, 2026 20:51180,3481,508,512,1741,491,882,0005,009,0002,134,016
9May 20, 2026 20:51180,8461,514,486,5751,494,972,0006,057,0002,134,016