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 17, 2026 12:41timothygktimothygkScore: 40,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 12:4540,955350,799,119338,859,0001,070,0002,117,632stderr
2Oct 17, 2026 12:4540,970350,996,108339,049,0001,005,0002,117,632stderr
3Oct 17, 2026 12:4540,976351,071,162338,997,0001,110,0002,117,632stderr
4Oct 17, 2026 12:4540,981351,122,579339,145,0001,004,0002,117,632stderr
5Oct 17, 2026 12:4540,981351,085,749339,128,0001,016,0002,117,632stderr
6Oct 17, 2026 12:4540,984351,167,767339,065,0001,103,0002,117,632stderr
7Oct 17, 2026 12:4541,004351,239,526339,223,0001,114,0002,117,632stderr
8Oct 17, 2026 12:4541,004351,845,829339,334,0001,004,0002,117,632stderr
9Oct 17, 2026 12:4541,010351,425,050339,314,0001,069,0002,117,632stderr