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 21:34TonyTonyScore: 53,796Success
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 21:3453,771454,740,792445,301,0001,004,0002,117,632
2Aug 1, 2026 21:3453,790455,354,537445,458,0001,004,0002,117,632
3Aug 1, 2026 21:3453,792454,858,480445,478,0001,003,0002,117,632
4Aug 1, 2026 21:3453,796454,942,634445,500,0001,011,0002,117,632
5Aug 1, 2026 21:3453,796454,889,970445,507,0001,003,0002,117,632
6Aug 1, 2026 21:3453,801454,813,407445,550,0001,004,0002,117,632
7Aug 1, 2026 21:3453,827455,099,325445,760,0001,005,0002,117,632
8Aug 1, 2026 21:3455,345467,947,101458,368,0001,003,0002,117,632
9Aug 1, 2026 21:3455,345468,032,389458,365,0001,002,0002,117,632