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 listJul 5, 2026 19:35Kevin HeaveyKevin HeaveyScore: 5,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:365,13652,174,80541,426,0001,208,0002,117,632
2Jul 5, 2026 19:365,13752,288,09741,488,0001,150,0002,117,632
3Jul 5, 2026 19:365,24753,486,47042,297,0001,254,0002,117,632
4Jul 5, 2026 19:365,25253,152,99642,478,0001,121,0002,117,632
5Jul 5, 2026 19:365,25253,169,22642,383,0001,216,0002,117,632
6Jul 5, 2026 19:365,28153,402,63642,674,0001,160,0002,117,632
7Jul 5, 2026 19:365,29053,496,71242,676,0001,232,0002,117,632
8Jul 5, 2026 19:365,30453,615,00842,993,0001,034,0002,117,632
9Jul 5, 2026 19:365,31153,692,28042,860,0001,226,0002,117,632