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 18, 2026 01:41Yuriy LyfenkoYuriy LyfenkoScore: 5,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 01:405,64375,435,28843,851,0002,989,0002,285,568
2Mar 18, 2026 01:405,65073,151,71343,899,0002,993,0002,301,952
3Mar 18, 2026 01:405,71073,210,64244,372,0003,025,0002,297,856
4Mar 18, 2026 01:405,76771,941,72647,863,00002,277,376
5Mar 18, 2026 01:415,77577,563,65744,937,0002,995,0002,285,568
6Mar 18, 2026 01:405,79079,717,48547,058,0001,001,0002,306,048
7Mar 18, 2026 01:405,79478,657,44245,084,0003,005,0002,289,664
8Mar 18, 2026 01:405,79773,045,74046,107,0002,004,0002,301,952
9Mar 18, 2026 01:415,80573,436,85745,170,0003,011,0002,285,568
10Mar 18, 2026 01:405,82775,492,29745,342,0003,022,0002,404,352
11Mar 18, 2026 01:415,84576,355,04147,504,0001,010,0002,310,144
12Mar 18, 2026 01:405,85377,826,62347,570,0001,012,0002,285,568