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 listAug 9, 2025 03:20Leon ZhaoLeon ZhaoScore: 14,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 03:2014,020135,459,514115,360,0001,003,0002,473,984
2Aug 9, 2025 03:2014,029143,669,802116,441,00002,285,568
3Aug 9, 2025 03:2014,032143,030,234115,465,0001,004,0002,465,792
4Aug 9, 2025 03:2014,034146,003,775116,482,00002,285,568
5Aug 9, 2025 03:2014,038144,440,961116,512,00002,285,568
6Aug 9, 2025 03:2014,039140,615,690115,517,0001,004,0002,465,792
7Aug 9, 2025 03:2014,040143,737,695115,529,0001,004,0002,285,568
8Aug 9, 2025 03:2014,049145,901,625114,611,0001,993,0002,285,568
9Aug 9, 2025 03:2015,455151,466,159127,277,0001,002,0002,285,568