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 11, 2025 23:10cures1cures1Score: 368,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 23:10367,9173,084,151,6702,997,737,00055,976,0002,281,472
2May 11, 2025 23:10367,9803,078,086,1182,991,247,00062,984,0002,289,664
3May 11, 2025 23:10368,0903,078,827,6552,994,185,00060,963,0002,289,664
4May 11, 2025 23:10368,2333,083,387,8132,988,374,00067,963,0002,289,664
5May 11, 2025 23:10368,4623,085,127,3762,995,272,00062,963,0002,285,568
6May 11, 2025 23:10368,6753,089,141,0423,004,038,00055,963,0002,285,568
7May 11, 2025 23:10368,6923,086,876,1242,982,189,00077,952,0002,281,472
8May 11, 2025 23:10368,8003,094,707,3642,990,084,00070,954,0002,281,472
9May 11, 2025 23:10370,2763,101,079,4622,997,336,00075,957,0002,281,472