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:25George SeabridgeGeorge SeabridgeScore: 8,670Success
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:258,60081,286,22570,373,0001,012,0002,113,536
2Aug 1, 2026 13:258,61481,663,62670,410,0001,092,0002,113,536
3Aug 1, 2026 13:258,62781,733,70870,508,0001,101,0002,113,536
4Aug 1, 2026 13:258,64381,724,25570,573,0001,171,0002,113,536
5Aug 1, 2026 13:258,67082,019,49370,877,0001,085,0002,113,536
6Aug 1, 2026 13:258,68282,103,64270,970,0001,097,0002,113,536
7Aug 1, 2026 13:258,68483,482,34270,983,0001,095,0002,113,536
8Aug 1, 2026 13:258,70282,186,26371,153,0001,079,0002,113,536
9Aug 1, 2026 13:258,91584,186,19172,895,0001,104,0002,113,536