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 13:35Kevin HeaveyKevin HeaveyScore: 20,237Success
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 13:3820,228177,430,831166,820,0001,076,0002,117,632
2Jul 5, 2026 13:3820,228177,411,668166,830,0001,068,0002,117,632
3Jul 5, 2026 13:3820,234177,449,857166,877,0001,069,0002,117,632
4Jul 5, 2026 13:3820,236177,506,555166,875,0001,086,0002,117,632
5Jul 5, 2026 13:3820,237177,509,249166,913,0001,055,0002,117,632
6Jul 5, 2026 13:3820,246177,629,143166,976,0001,070,0002,117,632
7Jul 5, 2026 13:3820,248177,609,617166,975,0001,087,0002,117,632
8Jul 5, 2026 13:3820,249177,783,999166,934,0001,139,0002,117,632
9Jul 5, 2026 13:3820,270177,825,796167,097,0001,144,0002,117,632