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:56TonyTonyScore: 116,155Success
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:56111,148931,103,686921,534,0001,002,0002,117,632
2Aug 1, 2026 21:56111,168931,188,431921,693,0001,003,0002,117,632
3Aug 1, 2026 21:56111,190931,426,675921,880,0001,002,0002,117,632
4Aug 1, 2026 21:56111,197931,342,462921,938,0001,003,0002,117,632
5Aug 1, 2026 21:56116,155972,462,902963,087,0001,003,0002,117,632
6Aug 1, 2026 21:56116,156972,524,472963,102,0001,001,0002,117,632
7Aug 1, 2026 21:56116,170972,752,250963,213,0001,000,0002,117,632
8Aug 1, 2026 21:56116,181972,767,138963,305,0001,002,0002,117,632
9Aug 1, 2026 21:56116,191972,888,041963,385,0001,001,0002,117,632