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 listSep 24, 2026 10:55wnwnScore: 3,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 10:563,30836,271,66426,459,0001,004,0002,113,536
2Sep 24, 2026 10:563,32436,462,58426,552,0001,044,0002,113,536
3Sep 24, 2026 10:563,34237,700,64726,741,0001,005,0002,113,536
4Sep 24, 2026 10:563,35636,625,21426,822,0001,037,0002,113,536
5Sep 24, 2026 10:563,44137,484,82927,488,0001,073,0002,113,536
6Sep 24, 2026 10:563,45738,088,06927,662,0001,038,0002,113,536
7Sep 24, 2026 10:563,46838,829,71327,758,0001,033,0002,113,536
8Sep 24, 2026 10:563,46937,598,10227,767,0001,032,0002,113,536
9Sep 24, 2026 10:563,48538,315,33727,918,0001,014,0002,113,536