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 21:46TonyTonyScore: 7,691Success
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 21:467,65873,303,84661,234,0002,330,0002,113,536
2Aug 6, 2026 21:467,66473,389,66861,348,0002,264,0002,113,536
3Aug 6, 2026 21:467,68173,502,49761,496,0002,258,0002,113,536
4Aug 6, 2026 21:467,68573,601,12661,535,0002,253,0002,113,536
5Aug 6, 2026 21:467,69173,687,23661,542,0002,295,0002,113,536
6Aug 6, 2026 21:467,69273,641,82661,607,0002,243,0002,113,536
7Aug 6, 2026 21:467,70273,768,53361,664,0002,263,0002,113,536
8Aug 6, 2026 21:467,70473,718,47561,703,0002,248,0002,113,536
9Aug 6, 2026 21:467,71473,868,71461,765,0002,269,0002,113,536