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 24, 2026 20:39Dominique GarmierDominique GarmierScore: 7,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 20:427,59090,521,14761,000,0002,000,0002,330,624
2Mar 24, 2026 20:437,63888,399,29561,386,0002,012,0002,289,664
3Mar 24, 2026 20:427,67188,677,92462,658,0001,010,0002,334,720
4Mar 24, 2026 20:397,68790,028,32061,806,0001,993,0002,289,664
5Mar 24, 2026 20:427,69190,025,50962,824,0001,013,0002,322,432
6Mar 24, 2026 20:397,72189,569,32263,081,0001,001,0002,334,720
7Mar 24, 2026 20:437,72191,828,56763,085,0001,001,0002,330,624
8Mar 24, 2026 20:437,73789,900,27263,210,0001,003,0002,289,664
9Mar 24, 2026 20:397,96695,729,88864,112,0002,003,0002,330,624