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 02:49Yuriy LyfenkoYuriy LyfenkoScore: 5,283Success
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 02:495,26073,617,24042,644,0001,015,0002,289,664
2Mar 18, 2026 02:495,26069,487,28441,630,0002,030,0002,285,568
3Mar 18, 2026 02:495,27869,953,30041,819,0001,991,0002,285,568
4Mar 18, 2026 02:495,27973,221,09840,827,0002,987,0002,301,952
5Mar 18, 2026 02:495,28372,476,32642,853,000996,0002,293,760
6Mar 18, 2026 02:495,30678,892,35642,036,0002,001,0002,297,856
7Mar 18, 2026 02:495,33672,310,36542,275,0002,013,0002,293,760
8Mar 18, 2026 02:495,43871,325,15243,132,0002,006,0002,285,568
9Mar 18, 2026 02:495,48869,043,63042,513,0003,036,0002,285,568