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:23Aniruddha DebAniruddha DebScore: 23,223Success
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:2323,190216,355,505192,479,00002,428,928
2Feb 15, 2025 01:2323,210218,423,478191,642,000998,0002,428,928
3Feb 15, 2025 01:2323,219216,050,696191,719,000998,0002,428,928
4Feb 15, 2025 01:2323,221219,270,023191,740,000998,0002,531,328
5Feb 15, 2025 01:2323,223221,615,308191,755,000998,0002,531,328
6Feb 15, 2025 01:2323,224219,329,893191,763,000998,0002,433,024
7Feb 15, 2025 01:2323,226219,419,475191,776,000998,0002,420,736
8Feb 15, 2025 01:2323,237214,062,931191,867,000999,0002,428,928
9Feb 15, 2025 01:2323,957221,696,795197,840,000999,0002,531,328