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 listOct 24, 2026 11:23Nao MinamiNao MinamiScore: 21,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 11:2321,046186,127,703173,427,0001,259,0002,113,536
2Oct 24, 2026 11:2321,068185,874,856173,675,0001,195,0002,113,536
3Oct 24, 2026 11:2321,085185,945,115173,744,0001,265,0002,113,536
4Oct 24, 2026 11:2321,103186,079,726173,985,0001,175,0002,113,536
5Oct 24, 2026 11:2321,113186,205,691173,994,0001,251,0002,113,536
6Oct 24, 2026 11:2321,116186,194,646174,027,0001,240,0002,113,536
7Oct 24, 2026 11:2321,366188,280,253176,159,0001,182,0002,113,536
8Oct 24, 2026 11:2321,418188,805,585176,526,0001,248,0002,113,536
9Oct 24, 2026 11:2321,426188,914,770176,578,0001,266,0002,113,536