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 listJan 17, 2025 17:01ttmxttmxScore: 33,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 17:0133,076300,835,496273,526,0001,001,0002,265,088
2Jan 17, 2025 17:0133,099300,692,769272,726,0001,997,0002,289,664
3Jan 17, 2025 17:0133,105298,461,818272,773,0001,998,0002,269,184
4Jan 17, 2025 17:0133,107296,908,278272,791,0001,998,0002,363,392
5Jan 17, 2025 17:0133,110299,479,311273,815,000999,0002,289,664
6Jan 17, 2025 17:0133,110296,944,769272,813,0001,998,0002,277,376
7Jan 17, 2025 17:0133,117298,054,433272,868,0001,999,0002,265,088
8Jan 17, 2025 17:0133,127302,021,535272,951,0001,999,0002,293,760
9Jan 17, 2025 17:0133,129304,078,548272,972,0001,999,0002,289,664