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 04:59Elijah KinElijah KinScore: 49,853Success
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 04:5949,560441,423,647410,348,0001,000,0002,281,472
2Mar 18, 2026 04:5949,609439,911,572409,755,0001,998,0002,285,568
3Mar 18, 2026 04:5949,732440,482,636410,781,0001,998,0002,285,568
4Mar 18, 2026 04:5949,752437,177,460411,945,000999,0002,289,664
5Mar 18, 2026 04:5949,853441,363,276412,784,000999,0002,269,184
6Mar 18, 2026 04:5949,888437,623,336413,069,0001,000,0002,285,568
7Mar 18, 2026 04:5949,960445,520,082413,673,000999,0002,285,568
8Mar 18, 2026 04:5949,976442,092,806412,802,0001,999,0002,285,568
9Mar 18, 2026 04:5949,986435,426,135413,884,000999,0002,277,376