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 listFeb 15, 2025 01:29Aniruddha DebAniruddha DebScore: 23,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2025 01:2923,185214,957,242192,437,00002,531,328
2Feb 15, 2025 01:2923,220216,010,832192,726,00002,420,736
3Feb 15, 2025 01:2923,224221,688,596190,762,0001,997,0002,269,184
4Feb 15, 2025 01:2923,225217,603,223190,770,0001,997,0002,531,328
5Feb 15, 2025 01:2923,226221,471,628191,778,000998,0002,433,024
6Feb 15, 2025 01:2923,242219,150,818191,907,000999,0002,424,832
7Feb 15, 2025 01:2923,949225,284,127198,779,00002,531,328
8Feb 15, 2025 01:2923,950224,000,397197,788,000998,0002,510,848
9Feb 15, 2025 01:2923,958221,161,380197,855,000999,0002,531,328