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 3, 2026 04:47limanjun99limanjun99Score: 6,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 04:486,37771,325,49845,945,0006,991,0002,424,832
2May 3, 2026 04:486,37876,400,43445,948,0006,992,0002,404,352
3May 3, 2026 04:486,38976,180,30248,029,0005,003,0002,457,600
4May 3, 2026 04:486,39569,226,76748,077,0005,008,0002,420,736
5May 3, 2026 04:486,40976,324,96947,179,0006,022,0002,416,640
6May 3, 2026 04:486,42871,260,97246,313,0007,047,0002,416,640
7May 3, 2026 04:486,44071,673,86547,403,0006,051,0002,375,680
8May 3, 2026 04:486,44672,353,66147,449,0006,057,0002,424,832
9May 3, 2026 04:486,46072,436,50347,667,0005,958,0002,408,448