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 30, 2026 10:38Dominique GarmierDominique GarmierScore: 262,263Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 11:17256,0502,157,276,7972,125,217,00002,281,472
2Mar 30, 2026 11:17261,8832,202,806,7942,171,629,0001,998,0002,289,664
3Mar 30, 2026 10:38261,9932,199,333,2222,173,540,000999,0002,359,296
4Mar 30, 2026 10:38262,2632,207,043,2182,175,787,000999,0002,367,488
5Mar 30, 2026 10:38262,3132,204,219,0712,175,199,0001,999,0002,355,200
6Mar 30, 2026 11:17262,3942,208,010,0312,175,875,0001,998,0002,359,296