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 listMay 9, 2026 12:21wnwnScore: 3,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:223,36142,727,65226,849,0001,048,0002,486,272
2May 9, 2026 12:223,37943,832,41626,994,0001,053,0002,494,464
3May 9, 2026 12:223,39941,120,10227,127,0001,092,0002,494,464
4May 9, 2026 12:223,41945,668,56227,286,0001,097,0002,482,176
5May 9, 2026 12:223,42441,882,82227,379,0001,047,0002,486,272
6May 9, 2026 12:223,56045,815,12628,483,0001,072,0002,486,272
7May 9, 2026 12:223,56544,075,42528,515,0001,081,0002,478,080
8May 9, 2026 12:223,58345,043,27828,623,0001,119,0002,482,176
9May 9, 2026 12:223,62644,165,61929,013,0001,085,0002,486,272