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 3, 2025 18:34Rajarshi BasuRajarshi BasuScore: 8,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 18:348,26693,552,53068,609,00002,498,560
2Dec 3, 2025 18:348,27294,822,50867,652,0001,009,0002,502,656
3Dec 3, 2025 18:348,27493,607,17467,666,0001,009,0002,289,664
4Dec 3, 2025 18:348,287104,419,04168,781,00002,482,176
5Dec 3, 2025 18:348,28993,646,84066,805,0001,994,0002,289,664
6Dec 3, 2025 18:348,28994,204,08766,805,0001,994,0002,478,080
7Dec 3, 2025 18:348,28997,125,92266,807,0001,994,0002,289,664
8Dec 3, 2025 18:348,29194,907,36366,819,0001,994,0002,486,272
9Dec 3, 2025 18:348,29395,292,00266,840,0001,995,0002,289,664
10Dec 3, 2025 18:348,45693,692,50869,180,0001,002,0002,498,560
11Dec 3, 2025 18:348,45894,158,36468,199,0002,005,0002,490,368
12Dec 3, 2025 18:348,47692,836,38368,339,0002,009,0002,486,272