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 11, 2026 07:54janwwwjanwwwScore: 5,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 07:545,68956,066,09146,132,0001,093,0002,117,632
2Oct 11, 2026 07:545,70356,261,24446,242,0001,096,0002,117,632
3Oct 11, 2026 07:545,71056,362,62546,306,0001,090,0002,117,632
4Oct 11, 2026 07:545,71056,318,91146,308,0001,092,0002,117,632
5Oct 11, 2026 07:545,72056,512,29546,375,0001,104,0002,117,632
6Oct 11, 2026 07:545,75556,765,95646,668,0001,102,0002,117,632
7Oct 11, 2026 07:545,83057,226,49647,308,0001,087,0002,117,632
8Oct 11, 2026 07:545,85457,423,02847,506,0001,090,0002,117,632
9Oct 11, 2026 07:545,87157,571,50347,642,0001,091,0002,117,632