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 listDec 4, 2025 13:29Rajarshi BasuRajarshi BasuScore: 8,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:298,18193,450,83165,905,0001,997,0002,281,472
2Dec 4, 2025 13:298,19197,063,16265,990,0001,999,0002,490,368
3Dec 4, 2025 13:298,19393,633,33966,001,0002,000,0002,486,272
4Dec 4, 2025 13:298,19491,235,22766,013,0002,000,0002,289,664
5Dec 4, 2025 13:298,20693,616,91566,106,0002,003,0002,338,816
6Dec 4, 2025 13:298,22489,517,18767,260,0001,003,0002,342,912
7Dec 4, 2025 13:298,22692,730,24766,264,0002,008,0002,289,664
8Dec 4, 2025 13:298,23995,039,60067,379,0001,005,0002,289,664
9Dec 4, 2025 13:298,28496,190,55766,768,0001,993,0002,490,368
10Dec 4, 2025 13:298,35192,163,90367,306,0002,009,0002,289,664
11Dec 4, 2025 13:298,40996,671,01769,792,00002,289,664
12Dec 4, 2025 13:298,427100,636,06967,946,0001,998,0002,289,664