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 1, 2025 19:10Rajarshi BasuRajarshi BasuScore: 12,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 19:1012,225125,093,883100,460,0001,004,0002,383,872
2Dec 1, 2025 19:1012,234130,003,538100,540,0001,005,0002,490,368
3Dec 1, 2025 19:1012,242128,779,419100,602,0001,006,0002,281,472
4Dec 1, 2025 19:1012,246125,080,104100,639,0001,006,0002,383,872
5Dec 1, 2025 19:1012,297130,320,380100,062,0002,001,0002,289,664
6Dec 1, 2025 19:1012,304124,671,557100,123,0002,002,0002,289,664
7Dec 1, 2025 19:1012,309122,814,792100,159,0002,003,0002,289,664
8Dec 1, 2025 19:1012,527129,998,094103,977,00002,289,664
9Dec 1, 2025 19:1012,530127,720,080101,000,0003,000,0002,289,664