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 listNov 8, 2025 23:10izotoffizotoffScore: 61,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 23:1061,335530,530,348504,074,0005,010,0002,322,432
2Nov 8, 2025 23:1061,355533,491,296508,244,0001,000,0002,289,664
3Nov 8, 2025 23:1061,361534,263,833507,292,0002,001,0002,408,448
4Nov 8, 2025 23:1061,364537,930,072506,320,0003,001,0002,318,336
5Nov 8, 2025 23:1061,368539,647,805508,352,0001,000,0002,285,568
6Nov 8, 2025 23:1061,379536,381,895505,448,0003,995,0002,322,432
7Nov 8, 2025 23:1061,380533,494,659508,454,0001,000,0002,318,336
8Nov 8, 2025 23:1061,400543,851,273507,624,0001,998,0002,281,472
9Nov 8, 2025 23:1061,411536,310,408507,710,0001,998,0002,318,336