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 13:43George SeabridgeGeorge SeabridgeScore: 8,144Success
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 13:446,83166,717,10455,685,0001,013,0002,113,536
2Aug 1, 2026 13:447,62573,308,39862,200,0001,094,0002,113,536
3Aug 1, 2026 13:448,12777,414,00966,423,0001,033,0002,113,536
4Aug 1, 2026 13:448,13377,498,03566,426,0001,083,0002,113,536
5Aug 1, 2026 13:448,14477,601,16766,518,0001,083,0002,113,536
6Aug 1, 2026 13:448,16377,728,25066,674,0001,087,0002,113,536
7Aug 1, 2026 13:448,18177,917,93966,773,0001,133,0002,113,536
8Aug 1, 2026 13:448,19278,056,15666,905,0001,094,0002,113,536
9Aug 1, 2026 13:448,31778,992,44968,003,0001,029,0002,113,536