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 listFeb 2, 2026 21:08javivallejojavivallejoScore: 68,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 21:0868,875598,187,558569,662,0001,998,0002,519,040
2Feb 2, 2026 21:0868,937591,570,181571,179,0001,000,0002,502,656
3Feb 2, 2026 21:0868,938597,760,939572,184,00002,510,848