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 29, 2025 00:03Josu San MartinJosu San MartinScore: 35,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 23:5334,934318,912,272288,955,000999,0002,289,664
2Dec 28, 2025 23:5334,939312,837,819287,998,0001,999,0002,355,200
3Dec 28, 2025 23:5334,972313,015,250288,266,0002,001,0002,359,296
4Dec 29, 2025 00:0335,023317,385,858288,698,0001,997,0002,285,568
5Dec 29, 2025 00:0335,027315,947,019288,728,0001,998,0002,363,392
6Dec 29, 2025 00:0335,056317,304,778289,968,000999,0002,363,392