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,404Success
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:485,25969,573,15942,631,0001,015,0002,285,568
2Mar 18, 2026 02:485,26075,516,86541,629,0002,030,0002,285,568
3Mar 18, 2026 02:485,27269,601,70640,773,0002,983,0002,285,568
4Mar 18, 2026 02:495,28276,137,92040,850,0002,989,0002,301,952
5Mar 18, 2026 02:485,37770,583,05544,631,00002,285,568
6Mar 18, 2026 02:485,40370,922,42043,849,000996,0002,285,568
7Mar 18, 2026 02:485,40470,795,29043,854,000996,0002,285,568
8Mar 18, 2026 02:485,41974,445,75642,980,0001,999,0002,293,760
9Mar 18, 2026 02:485,42671,506,91244,032,0001,000,0002,420,736
10Mar 18, 2026 02:485,43269,866,58743,079,0002,003,0002,301,952
11Mar 18, 2026 02:495,44569,746,09642,181,0003,012,0002,285,568
12Mar 18, 2026 02:495,48974,962,85843,536,0002,024,0002,285,568