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 listMar 21, 2026 00:09Abhijit RamanAbhijit RamanScore: 63,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 00:0963,066550,120,771521,447,0001,997,0002,387,968
2Mar 21, 2026 00:0963,067550,071,835523,455,00002,256,896
3Mar 21, 2026 00:0963,070550,102,087521,483,0001,998,0002,383,872
4Mar 21, 2026 00:0963,146552,337,145523,112,0001,000,0002,379,776
5Mar 21, 2026 00:0963,158551,830,493523,215,0001,000,0002,375,680
6Mar 21, 2026 00:0963,159552,736,880522,220,0001,997,0002,383,872
7Mar 21, 2026 00:0963,215550,626,217523,682,000999,0002,260,992
8Mar 21, 2026 00:0963,269547,964,372524,131,0001,000,0002,519,040
9Mar 21, 2026 00:0963,318571,714,718524,539,000999,0002,523,136