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 listApr 26, 2026 14:47TudyMTudyMScore: 33,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:4833,811298,423,799278,634,0002,004,0002,473,984
2Apr 26, 2026 14:4833,816298,832,345277,679,0002,996,0002,387,968
3Apr 26, 2026 14:4833,823299,805,947278,741,0001,998,0002,473,984
4Apr 26, 2026 14:4833,826303,905,385278,758,0001,998,0002,375,680
5Apr 26, 2026 14:4833,826300,331,561273,769,0006,994,0002,322,432
6Apr 26, 2026 14:4833,826296,612,608277,764,0002,997,0002,387,968
7Apr 26, 2026 14:4833,829298,809,467277,785,0002,997,0002,383,872
8Apr 26, 2026 14:4833,830296,596,611277,794,0002,997,0002,379,776
9Apr 26, 2026 14:4833,872300,598,002280,143,0001,000,0002,383,872