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 listJun 19, 2026 17:56A_ShamanA_ShamanScore: 42,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:5642,053358,254,131265,800,00083,247,0002,113,536
2Jun 19, 2026 17:5642,136358,840,616265,968,00083,765,0002,113,536
3Jun 19, 2026 17:5642,245359,695,711266,452,00084,185,0002,113,536
4Jun 19, 2026 17:5642,456361,574,920267,214,00085,174,0002,113,536
5Jun 19, 2026 17:5642,565363,511,356267,298,00085,996,0002,113,536
6Jun 19, 2026 17:5642,624362,783,794267,601,00086,179,0002,113,536
7Jun 19, 2026 17:5642,753363,923,544267,421,00087,433,0002,113,536
8Jun 19, 2026 17:5642,877365,023,645267,601,00088,280,0002,113,536
9Jun 19, 2026 17:5642,881365,259,703267,521,00088,397,0002,113,536