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:14George SeabridgeGeorge SeabridgeScore: 8,135Success
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:156,85067,063,65455,767,0001,094,0002,113,536
2Aug 1, 2026 13:156,85066,838,67055,774,0001,084,0002,113,536
3Aug 1, 2026 13:156,86266,919,76955,877,0001,083,0002,113,536
4Aug 1, 2026 13:158,13077,512,12466,389,0001,091,0002,113,536
5Aug 1, 2026 13:158,13577,549,16666,433,0001,089,0002,113,536
6Aug 1, 2026 13:158,14177,961,67966,484,0001,092,0002,113,536
7Aug 1, 2026 13:158,15778,474,11266,617,0001,092,0002,113,536
8Aug 1, 2026 13:158,16577,851,46666,677,0001,097,0002,113,536
9Aug 1, 2026 13:158,17777,887,82466,785,0001,092,0002,113,536