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 listJun 22, 2025 13:02infiKNIGHTeinfiKNIGHTeScore: 339,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 13:02339,0082,841,822,0372,729,802,00083,963,0002,265,088
2Jun 22, 2025 13:02339,0232,845,070,5982,733,922,00079,968,0002,260,992
3Jun 22, 2025 13:02339,0992,844,991,6782,740,562,00073,961,0002,387,968