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 00:48Aniruddha DebAniruddha DebScore: 23,467Success
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 00:4823,426225,009,146194,439,00002,531,328
2Feb 15, 2025 00:4823,433216,916,569194,492,00002,531,328
3Feb 15, 2025 00:4823,446220,696,286194,605,00002,531,328
4Feb 15, 2025 00:4823,463225,282,248192,749,0001,997,0002,424,832
5Feb 15, 2025 00:4823,467220,778,143192,779,0001,997,0002,437,120
6Feb 15, 2025 00:4823,470218,305,020194,800,00002,424,832
7Feb 15, 2025 00:4823,476215,644,714193,851,000999,0002,437,120
8Feb 15, 2025 00:4823,485217,956,008193,930,000999,0002,531,328
9Feb 15, 2025 00:4824,004220,961,865198,233,0001,001,0002,531,328