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 13, 2026 08:57olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 16:05Yuriy Lyfenko22.63CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 16:06014,731,9000999,000401,408Exit with code 1:
2Mar 13, 2026 08:571,02123,640,7148,476,00002,371,584
3Mar 13, 2026 09:241,04126,560,9898,641,00002,273,280
4Mar 13, 2026 08:571,04224,012,1547,570,0001,081,0002,379,776
5Mar 13, 2026 08:571,04825,542,2687,612,0001,087,0002,273,280
6Mar 13, 2026 08:571,05328,803,6297,651,0001,093,0002,273,280
7Mar 13, 2026 08:571,05725,584,2408,774,00002,531,328
8Mar 13, 2026 09:241,05924,890,9878,789,00002,273,280
9Mar 13, 2026 08:571,06021,949,2658,795,00002,367,488
10Mar 13, 2026 08:571,06126,318,4567,704,0001,100,0002,273,280
11Mar 13, 2026 09:241,06224,506,1107,710,0001,101,0002,375,680
12Mar 13, 2026 08:571,07424,987,4427,925,000990,0002,375,680
13Mar 13, 2026 08:571,07829,769,1386,957,0001,987,0002,379,776