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 25, 2026 16:23Kenzie_RTKenzie_RTScore: 64,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:2463,845541,963,783528,914,0001,001,0002,113,536
2May 25, 2026 16:2463,871539,354,012529,024,0001,109,0002,113,536
3May 25, 2026 16:2463,943540,090,710529,578,0001,150,0002,113,536
4May 25, 2026 16:2463,946540,346,191529,668,0001,087,0002,113,536
5May 25, 2026 16:2464,091541,696,125530,927,0001,036,0002,113,536
6May 25, 2026 16:2464,231544,165,517532,035,0001,085,0002,113,536
7May 25, 2026 16:2464,330545,719,710532,907,0001,033,0002,113,536
8May 25, 2026 16:2464,348543,892,281533,078,0001,012,0002,113,536
9May 25, 2026 16:2464,813549,060,845536,753,0001,199,0002,113,536