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 4, 2025 07:04mebowlermebowlerScore: 83,115Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2025 07:0483,069714,680,014624,519,00064,950,0002,334,720
2Feb 4, 2025 07:0483,115712,366,843640,865,00048,989,0002,330,624
3Feb 4, 2025 07:0483,173716,336,722636,311,00054,026,0002,330,624