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 06:24Yuriy LyfenkoYuriy LyfenkoScore: 4,924Success
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 06:244,66162,505,71637,670,0001,018,0002,531,328
2Mar 18, 2026 06:244,66260,877,95837,677,0001,018,0002,269,184
3Mar 18, 2026 06:244,67768,313,96537,826,000995,0002,531,328
4Mar 18, 2026 06:244,68072,456,41536,856,0001,992,0002,310,144
5Mar 18, 2026 06:244,69364,015,24536,954,0001,997,0002,469,888
6Mar 18, 2026 06:244,92069,704,85138,845,0001,992,0002,473,984
7Mar 18, 2026 06:244,92463,142,30738,874,0001,993,0002,473,984
8Mar 18, 2026 06:244,92762,964,02038,902,0001,994,0002,531,328
9Mar 18, 2026 06:244,93363,372,86438,951,0001,997,0002,301,952
10Mar 18, 2026 06:244,93667,228,48138,967,0001,998,0002,531,328
11Mar 18, 2026 06:244,93867,063,95238,985,0001,999,0002,269,184
12Mar 18, 2026 06:244,96566,707,40339,202,0002,010,0002,269,184