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:37TonyTonyScore: 28,458Success
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:3727,437236,097,119226,615,0001,114,0002,117,632
2Aug 1, 2026 23:3727,697238,348,261228,790,0001,103,0002,117,632
3Aug 1, 2026 23:3727,714238,341,737228,915,0001,115,0002,117,632
4Aug 1, 2026 23:3728,452244,485,455235,038,0001,119,0002,117,632
5Aug 1, 2026 23:3728,458244,813,117235,020,0001,182,0002,117,632
6Aug 1, 2026 23:3728,471244,597,036235,145,0001,171,0002,117,632
7Aug 1, 2026 23:3728,482244,744,850235,397,0001,005,0002,117,632
8Aug 1, 2026 23:3728,499245,160,596235,538,0001,006,0002,117,632
9Aug 1, 2026 23:3728,761247,084,426237,596,0001,123,0002,117,632