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 1, 2026 23:32TonyTonyScore: 29,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:3329,448252,908,030243,416,0001,008,0002,117,632
2Aug 1, 2026 23:3329,453253,077,221243,457,0001,006,0002,117,632
3Aug 1, 2026 23:3329,519253,360,552244,001,0001,007,0002,117,632
4Aug 1, 2026 23:3329,530253,694,806244,097,0001,007,0002,117,632
5Aug 1, 2026 23:3329,532253,445,536244,112,0001,008,0002,117,632
6Aug 1, 2026 23:3329,537253,854,526244,157,0001,006,0002,117,632
7Aug 1, 2026 23:3329,553253,800,903244,284,0001,007,0002,117,632
8Aug 1, 2026 23:3329,569254,269,038244,422,0001,007,0002,117,632
9Aug 1, 2026 23:3329,592254,215,935244,613,0001,006,0002,117,632