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 listApr 30, 2025 12:02vahookvahookScore: 45,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2025 12:0245,795401,020,346379,097,0001,000,0002,273,280
2Apr 30, 2025 12:0145,799403,200,721379,134,0001,000,0002,498,560
3Apr 30, 2025 12:0145,820403,071,670379,307,0001,000,0002,502,656
4Apr 30, 2025 12:0245,830411,371,826379,386,0001,001,0002,506,752
5Apr 30, 2025 12:0245,873405,085,328378,751,0001,998,0002,527,232
6Apr 30, 2025 12:0145,875406,702,518378,766,0001,998,0002,498,560