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 listAug 10, 2026 15:26Victor MerckléVictor MerckléScore: 4,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 15:284,34844,284,76034,981,0001,115,0002,117,632stderr
2Aug 10, 2026 15:284,34944,507,38434,989,0001,113,0002,117,632stderr
3Aug 10, 2026 15:284,35244,522,43735,024,0001,104,0002,117,632stderr
4Aug 10, 2026 15:284,35544,539,54335,032,0001,119,0002,117,632stderr
5Aug 10, 2026 15:284,35644,411,81835,050,0001,107,0002,117,632stderr
6Aug 10, 2026 15:284,35845,945,86635,054,0001,123,0002,117,632stderr
7Aug 10, 2026 15:284,37744,488,87435,286,0001,044,0002,117,632stderr
8Aug 10, 2026 15:284,38044,566,17735,241,0001,120,0002,117,632stderr
9Aug 10, 2026 15:284,41944,905,65335,673,0001,007,0002,117,632stderr