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 6, 2026 18:36wnwnScore: 4,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 18:364,33557,365,87233,984,0001,999,0002,273,280
2Mar 6, 2026 18:374,34160,505,13034,027,0002,001,0002,273,280
3Mar 6, 2026 18:364,35757,125,09534,152,0002,008,0002,273,280
4Mar 6, 2026 18:374,36056,490,94034,177,0002,010,0002,273,280
5Mar 6, 2026 18:374,38254,595,92635,363,0001,010,0002,269,184
6Mar 6, 2026 18:364,38561,538,80235,382,0001,010,0002,273,280
7Mar 6, 2026 18:364,38657,316,07635,390,0001,011,0002,494,464
8Mar 6, 2026 18:364,39162,091,24735,434,0001,012,0002,273,280
9Mar 6, 2026 18:404,39957,747,83235,497,0001,014,0002,486,272
10Mar 6, 2026 18:404,40160,892,17135,513,0001,014,0002,494,464
11Mar 6, 2026 18:364,40362,414,80135,526,0001,015,0002,273,280
12Mar 6, 2026 18:374,40662,212,27535,553,0001,015,0002,490,368
13Mar 6, 2026 18:404,41365,384,04035,608,0001,017,0002,273,280
14Mar 6, 2026 18:374,43763,190,44035,833,000995,0002,273,280
15Mar 6, 2026 18:374,43761,627,56234,834,0001,990,0002,273,280