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 18, 2026 15:46wnwnScore: 7,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:467,33091,460,30658,848,0001,994,0002,281,472
2Feb 18, 2026 15:467,34084,215,94858,923,0001,997,0002,428,928
3Feb 18, 2026 15:467,35784,397,30959,065,0002,002,0002,453,504