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 listSep 27, 2025 07:08sheryllynn24sheryllynn24Score: 6,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 07:096,22583,604,49351,671,00002,289,664
2Sep 27, 2025 07:096,24879,297,14549,867,0001,994,0002,265,088
3Sep 27, 2025 07:096,25284,166,12949,893,0001,995,0002,367,488
4Sep 27, 2025 07:096,25481,810,95948,914,0002,994,0002,289,664
5Sep 27, 2025 07:096,26778,297,98950,015,0002,000,0002,514,944
6Sep 27, 2025 07:096,27077,447,95350,039,0002,001,0002,289,664
7Sep 27, 2025 07:096,28377,492,18751,148,0001,002,0002,363,392
8Sep 27, 2025 07:096,29984,264,07850,273,0002,010,0002,289,664
9Sep 27, 2025 07:096,31481,669,91951,397,0001,007,0002,289,664