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 5, 2025 10:54caandocaandoScore: 5,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 10:545,52271,931,44543,843,0001,992,0002,379,776
2Nov 5, 2025 10:545,55869,285,73044,125,0002,005,0002,281,472
3Nov 5, 2025 10:545,59873,815,07445,452,0001,010,0002,269,184
4Nov 5, 2025 10:545,59973,360,38945,459,0001,010,0002,519,040
5Nov 5, 2025 10:545,60672,304,89345,517,0001,011,0002,531,328
6Nov 5, 2025 10:545,60775,595,57746,542,00002,285,568
7Nov 5, 2025 10:545,60976,489,49645,543,0001,012,0002,285,568
8Nov 5, 2025 10:545,60973,951,49546,552,00002,285,568
9Nov 5, 2025 10:545,64274,230,94244,839,0001,992,0002,285,568
10Nov 5, 2025 10:545,65570,995,20944,937,0001,997,0002,273,280
11Nov 5, 2025 10:545,71970,105,27246,458,0001,009,0002,285,568
12Nov 5, 2025 10:545,73068,485,68246,546,0001,011,0002,285,568