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 listApr 7, 2026 20:31Danylo MocherniukDanylo MocherniukScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2026 20:316,92586,636,02356,469,0001,008,0002,293,760
2Apr 7, 2026 20:316,92779,954,97556,484,0001,008,0002,297,856
3Apr 7, 2026 20:316,93685,499,02756,560,0001,010,0002,297,856
4Apr 7, 2026 20:316,93684,048,00156,556,0001,009,0002,297,856
5Apr 7, 2026 20:316,96782,371,06356,832,000997,0002,297,856
6Apr 7, 2026 20:316,96784,359,98956,831,000997,0002,297,856
7Apr 7, 2026 20:316,97086,460,08655,860,0001,995,0002,297,856
8Apr 7, 2026 20:316,97982,259,22055,925,0001,997,0002,297,856
9Apr 7, 2026 20:316,98381,564,61455,965,0001,998,0002,433,024