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 03:26Yuriy LyfenkoYuriy LyfenkoScore: 4,836Success
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 03:264,70764,077,17437,065,0002,003,0002,285,568
2Mar 18, 2026 03:264,71267,705,63336,105,0003,008,0002,277,376
3Mar 18, 2026 03:264,71364,353,71737,109,0002,005,0002,293,760
4Mar 18, 2026 03:264,71666,109,34737,139,0002,007,0002,301,952
5Mar 18, 2026 03:264,71864,878,96336,149,0003,012,0002,285,568
6Mar 18, 2026 03:264,71966,688,90236,155,0003,012,0002,412,544
7Mar 18, 2026 03:264,83666,307,48037,131,0003,010,0002,301,952
8Mar 18, 2026 03:264,84165,831,94937,164,0003,013,0002,293,760
9Mar 18, 2026 03:264,84673,161,93738,210,0002,011,0002,293,760
10Mar 18, 2026 03:264,85570,374,61937,277,0003,022,0002,285,568
11Mar 18, 2026 03:264,86169,367,35438,332,0002,017,0002,285,568
12Mar 18, 2026 03:264,89666,724,19038,607,0002,031,0002,285,568