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 20:57Joel SmithJoel SmithScore: 52,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 20:5752,892464,743,855437,001,0002,000,0002,465,792
2Mar 18, 2026 20:5752,912467,239,826437,169,0002,000,0002,375,680
3Mar 18, 2026 20:5752,917468,106,175438,208,0001,000,0002,367,488
4Mar 18, 2026 20:5752,919471,001,790437,224,0002,001,0002,371,584
5Mar 18, 2026 20:5752,924472,661,475438,270,0001,000,0002,375,680
6Mar 18, 2026 20:5752,928469,187,593438,302,0001,000,0002,371,584
7Mar 18, 2026 20:5752,931469,636,049437,327,0002,001,0002,383,872
8Mar 18, 2026 20:5752,958468,051,579438,550,000998,0002,379,776
9Mar 18, 2026 20:5752,979469,792,879436,725,0002,998,0002,371,584