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 8, 2026 09:43Brian ChewBrian ChewScore: 53,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 09:4353,608470,454,546375,952,00068,991,0002,363,392
2Feb 8, 2026 09:4353,642469,747,811376,346,00068,880,0002,502,656
3Feb 8, 2026 09:4355,352489,104,883374,529,00084,893,0002,297,856