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 listAug 6, 2026 20:49TonyTonyScore: 8,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 20:498,29178,824,04266,053,0002,764,0002,113,536
2Aug 6, 2026 20:498,31679,000,13566,285,0002,744,0002,113,536
3Aug 6, 2026 20:498,33979,212,10466,469,0002,747,0002,113,536
4Aug 6, 2026 20:498,35079,247,90566,529,0002,783,0002,113,536
5Aug 6, 2026 20:498,38279,618,90667,551,0002,025,0002,113,536
6Aug 6, 2026 20:498,38879,523,91966,881,0002,744,0002,113,536
7Aug 6, 2026 20:498,39579,721,60767,565,0002,120,0002,113,536
8Aug 6, 2026 20:498,43680,691,51767,912,0002,109,0002,113,536
9Aug 6, 2026 20:498,44080,003,04867,308,0002,751,0002,113,536